检索结果-内蒙古大学图书馆

Supercomputing conference

作者： V.E. Lynch J-N. Leboeuf B.A. Carreras J.D. Alvarez L. Garcia Oak Ridge National Laboratory Oak Ridge TN USA Universidad Carlos III de Madrid Madrid Spain

ISBN: (纸本)9780897919852

Full cross section calculations of ion-temperature-gradient-driven turbulence with Landau closure are being carried out as part of the Numerical Tokamak Turbulence Project, one of the U. S. Department of Energy's Phase II Grand Challenges. Calculations of cylindrical multihelicity ion-temperature-gradient-driven turbulence with previously unattainable resolution were completed on the National Energy Research Scientific computing Center's 160- processor distributed-memory CRAY T3E parallel computer. Both T3E benchmark results and physics results will be presented. Work is in progress to increase the resolution, improve the performance of the parallel code, and include toroidal geometry in these calculations for the new fully configured, 512-processor, T3E-900 model.

关键词： Tokamaks Laboratories Geometry Stability Thermal conductivity Magnetic devices Toroidal magnetic fields Scientific computing Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

An efficient adaptive routing algorithm for the faulty star graph

An efficient adaptive routing algorithm for the faulty star ...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： L.Q. Bai H. Ebara H. Nakano Dept. of Commun. Osaka Univ. Japan

This paper introduces an adaptive distributed routing algorithm for the faulty star graph. By giving two routing rules based on the properties of nodes, an optimal routing function for the fault-free star graph is presented. For a given destination in the n-star graph, n-1 node-disjoint and edge-disjoint subgraphs, which are derived from n-1 adjacent edges of the destination, can be constructed by applying this routing function and the concept of breadth first search. When faults are encountered, the algorithm can route messages to the destination by finding a fault-free subgraph based on the local failure information. As long as the number f of faults (node faults and/or edge faults) is less than the degree n-1 of the n-star graph, the algorithm can adaptively find a path of length at most d+4f to route messages successfully from a source to a destination, where d is the distance between two nodes.

关键词： Routing Hypercubes System recovery Topology Fault tolerance Very large scale integration Algorithm design and analysis Costs Adaptive systems Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Efficient execution of parallel programs using partial strict triggering of program graph nodes

Efficient execution of parallel programs using partial stric...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： M. Ojstersek V. Zumer L. Pipan The Faculty of Electrical Engineering and Computer Science University of Maribor Maribor Slovenia The Faculty of Electrical and Computer Engineering University of Ljubljana Ljubljana Slovenia

Almost all coarse grained program graph nodes don't need all of their input operands at the beginning of their execution. Thereafter they can be scheduled a bit earlier. This type of program graph nodes triggering is called partial strict triggering. The missing operands will be requested later during the execution. Coarse grained program graph nodes send their output operand to all successors, as soon as they produce them. Successors of coarse grained program graph nodes will be scheduled earlier too, because they will receive their input operands sooner. An evaluation of improved CPM, VL and DSH scheduling algorithms is done in this paper. We have improved them with partial strict triggering of coarse grained program graph nodes.

关键词： Processor scheduling Scheduling algorithm Partitioning algorithms Dynamic scheduling Concurrent computing Clustering algorithms Multiprocessing systems Topology Computer science Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Configurable hardware for symbolic search operations

Configurable hardware for symbolic search operations

引用

International conference on parallel and distributed Systems (ICPADS)

作者： Seonil Choi Yongwha Chung V.K. Prasana University of Southern California USA Systems Engineering Section Electronics and Telecommunications Research Institute Taejon South Korea

Most intermediate and high-level vision tasks manipulate symbolic data. A kernel operation in these vision tasks is to search symbolic data satisfying certain geometric constraints. Such operations are data-dependent and their memory access patterns are irregular. In this paper, we propose a fast parallel design for symbolic search operations using configurable hardware. Using a pointer array and a bit-level index array, we manipulate the symbolic data and show high performance can be achieved. Depending on the input data, a corresponding search window is calculated and symbolic search operations are performed in parallel. Performance estimates using 16 Xilinx XC6216s and memory modules are very promising. Given 3519 line segments (extracted from an 1024/spl times/1024 pixel image), the operation can be performed in 1.11 milliseconds on our FPGA-based platform. On a Sun UltraSPARC Model 140, the same operation implemented using C takes 690 milliseconds. Although we illustrate our design for a specific search operation, our design technique can be applied to related search operations with minor modifications. Also, it can be ported to other FPGA devices.

关键词： Hardware Field programmable gate arrays Computer vision Concurrent computing Kernel High performance computing Data mining Machine vision Real time systems Data engineering

来源：评论

学校读者我要写书评

暂无评论

Algorithmic influences on I/O access patterns and parallel file system performance

Algorithmic influences on I/O access patterns and parallel f...

引用

International conference on parallel and distributed Systems (ICPADS)

作者： E. Smirni C.E. Elford A.J. Lavery A.A. Chien Department of Computer Science College of William and Mary Williamsburg VA USA Department of Computer Science University of Illinois Urbana-Champaign IL USA

For many scalable parallel applications, the input/output (I/O) barrier rivals or exceeds that of computation and interprocessor communication. Consequently, scalable parallel secondary and tertiary storage systems are necessary to satisfy the resource demands of many national challenge problems. At present, one major challenge facing the designers of such storage systems is the wide range of I/O access patterns and the lack of general purpose file system policies that achieve high performance for variable I/O requirements. We analyze the I/O behavior of two scientific applications on the Intel Paragon XP/S. Although the two applications solve the same scientific problem and their I/O access patterns are qualitatively similar, their interactions with the file system are decidedly different. Our results show that appropriate tuning of file system policy parameters to I/O demands can significantly increase I/O throughput.

关键词： System performance File systems Application software Computer science Contracts Chemistry Educational institutions Pattern analysis Throughput Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Calculating optimal flit size and upper limit on the performance of wormhole routing

Calculating optimal flit size and upper limit on the perform...

引用

IEEE International conference on Algorithms and Architectures for parallel Processing (ICAP)

作者： A. Symons V. Lakshmi Narasimhan CiTR Pty Limited University of Queensland QLD Australia Information Technology Division Head information Management Group SA Australia

The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer size, and hence show that for medium to large messages, the communication time using wormhole routing is dependent on the square root of the network diameter.

关键词： Routing Multiprocessor interconnection networks distributed computing Concurrent computing Application software Message passing Costs Switches Delay Australia

来源：评论

学校读者我要写书评

暂无评论

Turn grouping for efficient barrier synchronization in wormhole mesh networks

Turn grouping for efficient barrier synchronization in wormh...

引用

International conference on parallel Processing (ICPP)

作者： Kuo-Pao Fan Chung-Ta Kin Department of Computer Science National Tsing Hua University Hsinchu Taiwan National Tsing Hua University Hsinchu TW

ISBN: (纸本)081868108X

Barrier is an important synchronization operation. On scalable parallel computers, it is often implemented as a collective communication with a reduction operation followed by a distribution operation. In this paper, we introduce a systematic way of generating efficient algorithms to perform barrier synchronization in mesh networks. The scheme works with any base routing algorithm derivable from the turn model. Our scheme extends the turn grouping method with two new algorithms, Tail to Central and Central to Tail, for scheduling the message transmission in the reduction and distribution phase respectively. Simulation results show that our approach can take advantage of the adaptivity of the turn-model based routing algorithms and outperform methods proposed previously.

关键词： Intelligent networks Mesh networks Routing Partitioning algorithms Concurrent computing Multicast algorithms Computer science distributed computing Mesh generation Councils

来源：评论

学校读者我要写书评

暂无评论

Scalable multicomputer object spaces: a foundation for high performance systems

Scalable multicomputer object spaces: a foundation for high ...

引用

Working conference on Massively parallel Programming Models

作者： S.M. Blackburn R.B. Stanton Dept. of Comput. Sci. Australian Nat. Univ. Canberra ACT Australia Department of Computer Science Australian National University Canberra ACT Australia

The development of scalable architectures at store levels of a layered model has concentrated on processor parallelism balanced against scalable memory bandwidth, primarily through distributed memory structures of one kind or another. A great deal of attention has been paid to hiding the distribution of memory to produce a single store image across the memory structure. It is unlikely that the distribution and concurrency aspects of scalable computing can be completely hidden at that level. This paper argues for a store layer which respects the need for caching and replication, and to do so at an "object" level granularity of memory use. These facets are interrelated through atomic processes, leading to an interface for the store which is strongly transactional in character. The paper describes the experimental performance of such a layer on a scalable multi-computer architecture. The behaviour of the store supports the view that a scalable cached "transactional" store architecture is a practical objective for high performance based on parallel computation across distributed memories.

关键词： High performance computing Computer architecture Concurrent computing distributed computing Bandwidth parallel processing Scalability Computer science Atomic layer deposition Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Toward a scalable design for command and control systems

Toward a scalable design for command and control systems

引用

Workshop on parallel and distributed Real-Time Systems

作者： J.A. Caruso Computer Science Corporation Dahlgren VA USA

Command and control systems exist in a world of constantly shifting demands and expectations; therefore, producing scalable, evolvable systems has always been a priority of system designers. However the need to meet performance requirements has often been a restraint on scalability goals. advances in the speed and capacity of computational and communications equipment have substantially increased the range of scalability that can be achieved while still meeting performance requirements. The High Performance distributed computing Program (HiPer-D) has demonstrated a design for the AEGIS weapons system, which is close to achieving the full range of operational requirements while providing scalability along several dimensions. This paper discusses the HiPer-D design, its context, development, and efforts to achieve system level performance.

关键词： Command and control systems Scalability Fault tolerance Hardware Communication equipment distributed computing Weapons Application software Computer architecture Resource management

来源：评论

学校读者我要写书评

暂无评论

Optimizing the number of processing nodes and I/O nodes in a shared disk parallel database system: SPAX

Proceedings of the Conference on High Performance Computing ...

引用

proceedings of the conference on High Performance computing on the Information Superhighway, HPC Asia'97 1997年 667-671页

作者： Park, Young Kyu Jin, Seongil Cho, Sung Hyun Lee, Joon Seok Kaya Univ Korea Republic of

In a shared disk architecture like a SPAX system, messages for concurrency/coherency control and data transmission due to disk sharing degrade the system performance. But the network speed in a SPAX system is sufficiently fast, and network traffic does not deteriorate the system performance. However, the number of processing nodes and that of I/O nodes for disk I/O can be a bottleneck in the SPAX system. We study the effect of the number of processing nodes and I/O nodes on the system performance.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：