Performance comparison of a set of periodic and non-periodic tridiagonal solvers on SP2 and Paragon parallel computers
✍ Scribed by Sun, Xian-he; Moitra, Stuti
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 261 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1040-3108
No coin nor oath required. For personal study only.
✦ Synopsis
Various tridiagonal solvers have been proposed in recent years for different parallel platforms. In this paper, the performance of three tridiagonal solvers, namely, the parallel partition LU algorithm, the parallel diagonal dominant algorithm, and the reduced diagonal dominant algorithm, is studied. These algorithms are designed for distributed-memory machines and are tested on an Intel Paragon and an IBM SP2 machine. Measured results are reported in terms of execution time and speedup. Analytical studies are conducted for different communication topologies and for different tridiagonal systems. The measured results match the analytical results closely. In addition to addressing implementation issues, performance considerations such as problem sizes and models of speedup are also discussed.