By Topic

Challenges in matching parallel architectures and matrix algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
R. E. Benner ; Sandia Nat. Labs., Albuquerque, NM, USA

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.<>

Published in:

Compcon Spring '88. Thirty-Third IEEE Computer Society International Conference, Digest of Papers

Date of Conference:

Feb. 29 1988-March 3 1988