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

International Symposium on parallel Processing

作者： I. Al-Furaih S. Aluru S. Goil S. Ranka School of Computer and Information Science and Northeast Parallel Architectures Center Syracuse University Syracuse NY USA

In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. Experimental results on t... 详细信息

关键词： Concurrent computing Distributed computing

来源：评论

学校读者我要写书评

暂无评论

High-Performance Fortran and possible extensions to support conjugate gradient algorithms 96

High-Performance Fortran and possible extensions to support ...

引用

International Symposium on High Performance Distributed Computing

作者： K. Dincer G.C. Fox K. Hawick School of Computer and Information Sciences Northeast Parallel Architectures Center Syracuse University NY USA

ISBN: (纸本)9780818675829

Evaluates the High Performance Fortran (HPF) language for the compact expression and efficient implementation of conjugate-gradient iterative matrix-solvers on high-performance computing and communications (HPCC) platforms. We discuss the use of intrinsic functions, data distribution directives and explicitly parallel constructs to optimize performance by minimizing communications requirements in a portable manner. We focus on implementations using the existing HPF definitions but also discuss issues arising that may influence a revised definition for HPF-2. Some of the codes discussed are available on the World Wide Web at http://***/hpfa/, along with other educational and discussion material related to applications in HPF.

关键词： Character generation Sparse matrices Concurrent computing Programming profession Equations Iterative algorithms Physics computing Distributed computing Program processors Fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the computation and communication performance of the CM-5†

引用

Concurrency and Computation: Practice and Experience 1996年第1期8卷

作者： Kivanc Dincer Zeki Bozkus Sanjay Ranka Geoffrey Fox Northeast Parallel Architectures Center and School of Computer and Information Science 111 College Place Room 3–217 Center for Science and Technology Syracuse University Syracuse NY 13244–4100 USA

Thinking Machines' CM-5 machine is a distributed-memory, message-passing computer. In the paper we devise a performance benchmark for the base and vector units and the data communication networks of the CM-5 machine. We model the communication characteristics such as communication latency and bandwidths of point-to-point and global communication primitives. We show, on a simple Gaussian elimination code, that an accurate static performance estimation of parallel algorithms is possible by using those basic machine properties connected with computation, vectorization, communication and synchronization. Futhermore, we describe the embedding of meshes or hypercubes on the CM-5 fat-tree topology and illustrate the performance results of their basic communication primitives.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel remapping algorithms for adaptive problems

Parallel remapping algorithms for adaptive problems

引用

Frontiers of Massively parallel Computation

作者： Chao-Wei Ou S. Ranka Northeast Parallel Architectures Center and School of Computer and Information Science Syracuse University Syracuse NY USA

We present fast parallel algorithms for remapping a class of irregular and adaptive problems on coarse-grained distributed-memory machines. We show that the remapping of these applications, using simple index-based mapping algorithms, can be reduced to sorting a nearly sorted list of integers or merging an assorted list of integers with a sorted list of integers. By using the algorithms we have developed, the remapping of these problems can be achieved at a fraction of the cost of mapping from scratch. Results of experiments performed on the CM-5 are presented.< >

关键词： Partitioning algorithms Concurrent computing Physics computing Chaotic communication Sorting Costs Finite element methods information science Contracts Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel Gauss-Seidel algorithm for sparse power system matrices 94

A parallel Gauss-Seidel algorithm for sparse power system ma...

引用

Supercomputing Conference

作者： D.P. Koester S. Ranka G.C. Fox School of Computer and Information Science and The Northeast Parallel Architectures Center (NPAC) Syracuse University Syracuse NY USA

ISBN: (纸本)9780818666056

We describe the implementation and performance of an efficient parallel Gauss-Seidel algorithm that has been developed for irregular, sparse matrices from electrical power systems applications. Although, Gauss-Seidel algorithms are inherently sequential, by performing specialized orderings on sparse matrices, it is possible to eliminate much of the data dependencies caused by precedence in the calculations. A two-part matrix ordering technique has been developed-first to partition the matrix into block-diagonal-bordered form using diakoptic techniques and then to multi-color the data in the last diagonal block using graph coloring techniques. The ordered matrices often have extensive parallelism, while maintaining the strict precedence relationships in the Gauss-Seidel algorithm. We present timing results for a parallel Gauss-Seidel solver implemented on the Thinking Machines CM-5 distributed memory multi-processor. The algorithm presented here requires active message remote procedure calls in order to minimize communications overhead and obtain good relative speedup.< >

关键词： Gaussian processes Power systems Sparse matrices Transmission line matrix methods Power system interconnection Gaussian distribution Equations Concurrent computing information science parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Runtime array redistribution in HPF programs

Runtime array redistribution in HPF programs

引用

Scalable High Performance Computing Conference

作者： R. Thakur A. Choudhary G. Fox Northeast Parallel Architectures Center Department of Electrical and Computer Syracuse University Syracuse NY USA Northeast Parallel Architectures Center Department of Electrical and Computer Syracuse University Syracuse NY USA Northeast Parallel Architectures Center Department of Computer and Information Science Syracuse University Syracuse NY USA

Describes efficient algorithms for runtime array redistribution in High Performance Fortran (HPF) programs. We consider block(m)-to-cyclic, cyclic-to-block(m) and the general cyclic(x)-to-cyclic(y) type redistributions. We initially describe algorithms for one-dimensional arrays and then extend the methodology to multidimensional arrays. The algorithms are practical enough to be easily implemented in the runtime library of an HPF compiler and can also be directly used in application programs requiring redistribution. Performance results on the Intel Paragon are discussed.< >

关键词： Programmable logic arrays Distributed computing Runtime library Program processors Message passing Algorithms Multidimensional systems parallel architectures Educational institutions Vector processors

来源：评论

学校读者我要写书评

暂无评论

Complete exchange on a wormhole routed mesh

Complete exchange on a wormhole routed mesh

引用

International Symposium on Modeling, Analysis and Simulation of computer and Telecommunication Systems (MASCOTS)

作者： R. Thakur A. Choudhary G. Fox Northeast Parallel Architectures Center Department of Electrical and Computer Eng Syracuse University Syracuse NY USA Northeast Parallel Architectures Center Department of Computer and Information Science Syracuse University Syracuse NY USA

The complete exchange (or all-to-all personalized) communication pattern occurs frequently in many important parallel computing applications. We discuss several algorithms to perform complete exchange on a two dimensional mesh connected computer with wormhole routing. We propose algorithms for both power-of-two and non power-of-two meshes as well as an algorithm which works for any arbitrary mesh. We have developed analytical models to estimate the performance of the algorithms on the basis of system parameters. These models take into account the effects of link contention and other characteristics of the communication system. Performance results on the Intel Touchstone Delta are presented and analyzed.< >

关键词： Routing Application software Analytical models Bandwidth Hypercubes Delay Concurrent computing parallel architectures Educational institutions parallel processing

来源：评论

学校读者我要写书评

暂无评论

An interactive remote visualization environment for an electromagnetic scattering simulation on high performance computing system 93

An interactive remote visualization environment for an elect...

引用

Proceedings of the 1993 ACM/IEEE conference on Supercomputing

作者： G. Cheng Y. Lu G. Fox K. Mills T. Haupt Northeast Parallel architectures Center Syracuse University Syracuse NY Northeast Parallel architectures Center School of Computer and Information Science Syracuse University Syracuse NY

来源：评论

学校读者我要写书评

暂无评论

An interactive remote visualization environment for an electromagnetic scattering simulation on a high performance computing system

An interactive remote visualization environment for an elect...

引用

Supercomputing Conference

作者： G. Cheng Y. Lu G. Fox K. Mills T. Haupt School of Computer and Information Science Syracuse University Syracuse NY USA Northeast Parallel Architectures Center USA

An integrated interactive visualization environment was created for an electromagnetic scattering (EMS) simulation, coupling a graphical user interface (GUI) for runtime simulation parameters input and 3-D rendering output on a graphical workstation, with computational modules running on a parallel supercomputer and two workstations. Application Visualization System (AVS) was used as integrating software to facilitate both networking and scientific data visualization. Using the EMS simulation as a case study, the authors explore the AVS dataflow methodology to naturally integrate data visualization, parallel systems and heterogeneous computing. Major issues in integrating this remote visualization system are discussed, including task decomposition, system integration, concurrent control, and a high level data-visualization-environment distributed programming model.

关键词： Electromagnetic scattering Computational modeling High performance computing Data visualization Medical services Graphical user interfaces Workstations Concurrent computing Electromagnetic coupling Runtime

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT TASK MANAGEMENT AND LOAD RE DISTRIBUTION ON MASSIVELY parallel HYPERCUBE SYSTEMS

FAULT-TOLERANT TASK MANAGEMENT AND LOAD RE DISTRIBUTION ON M...

引用

SUPERCOMPUTING 92 CONF

作者： AHMAD, I GHAFOOR, A School of Computer and Information Science Northeast Parallel Architectures Center Syracuse University Syracuse 13244 NY United States School of Electrical Engineering Purdue University West Lafayette 47907 IN United States

ISBN: (纸本)0818626305

In a massively parallel multicomputer system, consisting of hundreds or thousands of processors, it is very likely that some of its components (processors and links) will fail. If such a system is dedicated to time-critical applications with certain deadlines to meet, such failures can not be tolerated. We present a scheme for managing real-time task allocation and load re-distribution with fault-tolerance for hypercube systems. A set of processors, called fault-control processors (FCPs), can be used for keeping the duplicate copies of tasks and re-allocating tasks if the original processors of those tasks fail. Two-level task redundancy is used by grouping the FCPs as primary and secondary for each processor. The proposed scheme provides a high degree of fault-tolerance since each FCP itself is monitored by other FCPs. Assuming a failure-repair system environment, the performance of the proposed strategy has been evaluated and compared with a fault-free environment for 256-node and 512-nodehypercubes, through simulation experiments. We also introduce a measure of goodness, success probability, which represents the probability of re-allocated tasks meeting their deadlines despite the failure of processors. It is shown that using the proposed scheme, a large percentage of the re-scheduled tasks can still meet their deadlines. The probability of a task being lost altogether, due to multiple failures, has been shown to be extremely low. © 1992 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：