DocumentCode
2061631
Title
Block size selection of parallel LU factorization
Author
Zhang, Yunquan
Author_Institution
Inst. of Software, Acad. Sinica, Beijing, China
Volume
1
fYear
2000
fDate
14-17 May 2000
Firstpage
247
Abstract
We propose a unified framework and address the optimal block size selection problem for parallel blocked LU factorization based on the ScaLAPACK package. Since it uses block cyclic data distribution, block size plays an important role in determining the final performance. Through the analysis with our proposed framework and experiments on a small-scale system configuration, we found that among all these factors, load balance and local block size selection play key roles in determining the optimal block size on SR2201 (pseudo-vector based MPP machine). The optimal block size is determined by the processer grid shape and problem size. Based on this observation, an optimal block size prediction formula, with processor grid shape and problem size as parameters, is given that can match experimental results well. The application of our framework to scalar based parallel machines and other applications programs is future work.
Keywords
matrix decomposition; message passing; parallel algorithms; SR2201; block cyclic data distribution; block size selection; load balance; optimal block size prediction formula; parallel LU factorization; parallel blocked LU factorization; problem size; processer grid shape; processor grid shape; pseudo-vector based MPP machine;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on
Conference_Location
Beijing, China
Print_ISBN
0-7695-0589-2
Type
conf
DOI
10.1109/HPC.2000.846553
Filename
846553
Link To Document