๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Numerical algorithms for the hypercube concurrent processor

โœ Scribed by Jean E. Patterson; Farzin Manshadi; Ruel H. Calalo; Paulett C. Liewer; William A. Imbriale; James R. Lyons


Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
270 KB
Volume
11
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis


With the development of concurrent computing architectures which promise cost-effective means of obtaining supercomputing performance, there is much interest in applying and in evaluating the actual performance on large, computationally-intensive problems. Of particular interest is the concurrent performance of large scale electromagnetic scattering problems. Two electromagneticcodes with differing underlying algorithms have been converted to run on the Mark III Hypercube. One is a time domain finite difference solution of Maxwell's equations to solve for scattered fields and the other is a frequency domain moment method solution.

Important measures for demonstrating the utility of the parallel architecture are the size of the problem that can be solved and the efficiency by which the paralleling can increase the speed of execution.


๐Ÿ“œ SIMILAR VOLUMES


Fast Parallel Algorithms for Solving Tri
โœ O.H. Ibarra; M.H. Kim ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 864 KB

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec

An Efficient Algorithm for the k-Pairwis
โœ Qian-Ping Gu; Shietung Peng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype

The design and specification of post-pro
โœ R.M. Sim ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 525 KB

The role of the post-processor in computer programming systems for numerically controlled machines is described. Although many of the points discussed apply to the special purpose programs available, attention is concentrated on the position of the post-processor within the general purpose systems s