Computing the Least Squares Inverse of Sparse Matrices on a Network of Clusters

Baolai Ge ()
Additional contact information
Baolai Ge: The University of Western Ontario, SHARCNET

A chapter in Current Trends in High Performance Computing and Its Applications, 2005, pp 37-46 from Springer

Abstract: Summary This paper describes the calculation of the least square inverse of sparse matrices and the use of load balancing schemes for parallel processing in a heterogeneous environment. Due to the variation of number of non zero entries to be calculated row wise, as well as the difference of processor speeds, load imbalance may occur and have an impact on the performance. To improve the performance by keeping processors as busy as possible the redistribution of tasks and data is needed. We present an architecture and implementation outlines of a few load balancing schemes featured with one-sided communications in a framework of multithreading. We show through our tests that the use of load balancing schemes can improve the performance in some cases.

Keywords: Load Balance; Sparse Matrice; Sparsity Pattern; Krylov Subspace Method; Load Imbalance (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-27912-9_4

Ordering information: This item can be ordered from
http://www.springer.com/9783540279129

DOI: 10.1007/3-540-27912-1_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().