Title :
Challenges in matching parallel architectures and matrix algorithms
Author_Institution :
Sandia Nat. Labs., Albuquerque, NM, USA
fDate :
Feb. 29 1988-March 3 1988
Abstract :
Direct solution methods based on Gauss elimination and its variants are considered. These are of particular interest because they readily expose memory limitations and communication bottlenecks of parallel architectures, are integral components of other, more highly parallel matrix algorithms, and can solve poorly conditioned problems on which other methods fail. The parallel implementation and performance of a class of direct methods is examined on three architectures; namely, the CRAY X-MP/48, ELXSI 6400, and NCUBE/ten.<>
Keywords :
parallel architectures; CRAY X-MP/48; ELXSI 6400; Gauss elimination; NCUBE/ten; communication bottlenecks; matrix algorithms; memory limitations; parallel architectures matching; Computer architecture; Concurrent computing; Gaussian processes; Hypercubes; Integral equations; Iterative methods; Laboratories; Matrix decomposition; Parallel architectures; Parallel processing;
Conference_Titel :
Compcon Spring '88. Thirty-Third IEEE Computer Society International Conference, Digest of Papers
Conference_Location :
San Francisco, CA, USA
Print_ISBN :
0-8186-0828-5
DOI :
10.1109/CMPCON.1988.4833
