Performance of parallel solution of a block-tridiagonal linear system on Fujitsu VPP500
โ Scribed by K Sumiyoshi; T Ebisuzaki
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 377 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
โฆ Synopsis
We study the performance of parallel solution of a block-tridiagonal linear system adopting the ลฝ . block cyclic reduction BCR method. We develop a parallel code on Fujitsu VPP500 to solve a ลฝ . block-tridiagonal BT linear system and measure the speed of the parallel code on VPP500r28 at RIKEN in order to explore the ability to solve a large system. We study the dependence of the performance on the size of the BT matrix and explore the optimum condition to get high speed using our code. We find that our code solves problems with high speed of 31 Gflops and high parallel efficiency by taking advantage of both vectorization and parallelization. The code enables us to solve a larger system of radiative transfer problem in astrophysics than ever before as an application. Numerical results show that the BCR method works very well as a parallel algorithm on parallel computers with a sufficient specification for the communication. Possible performance of the BCR method on a larger system of parallel computers are addressed.
๐ SIMILAR VOLUMES
Bondeli, S\_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Computing 17 (1991) 419-434\_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel com