On the parallelization of blocked LU factorization algorithms on distributed memory architectures

Gregor Von Laszewski, Manish Parashar, A. Gaber Mohamed, Geoffrey C. Fox

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

Solutions to systems of linear equations and specifically, the LU factorization of matrices form the computational core of many scientific and engineering applications. In this paper, we present the parallelization of blocked algorithms for L U factorization. We isolate problems inherent to sequential blocked algorithms and provide approaches to overcome them on distributed memory architectures. The performance of the parallelized versions of three blocked algorithms suited to column oriented Fortran is compared. Experiments are performed on the iPSC/860 Hypercube. Our study shows that it is not intuitively clear which algorithm might perform best on a given architecture, but is dependent on the problem size and the number of available processors.

Original languageEnglish (US)
Title of host publicationProceedings of the 1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992
EditorsRobert Werner
PublisherAssociation for Computing Machinery
Pages170-179
Number of pages10
ISBN (Electronic)0818626305
DOIs
StatePublished - Dec 1 1992
Externally publishedYes
Event1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992 - Minneapolis, United States
Duration: Nov 16 1992Nov 20 1992

Publication series

NameProceedings of the International Conference on Supercomputing
VolumePart F129723

Other

Other1992 ACM/IEEE conference on Supercomputing, Supercomputing 1992
CountryUnited States
CityMinneapolis
Period11/16/9211/20/92

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the parallelization of blocked LU factorization algorithms on distributed memory architectures'. Together they form a unique fingerprint.

Cite this