The RSCG algorithm on distributed memory architectures
Lori A. Freitag, James M. Ortega · Numerical Linear Algebra with Applications · 1995
Abstract In this paper, we demonstrate the scalability of the Reduced System Conjugate Gradient (RSCG) algorithm on distributed memory architectures. We present speed‐up results obtained on the Intel iPSC/860 that compare one‐, two‐, and three‐dimensional decompositions of the domain for both positive definite and positive semidefinite test problems. We develop a model for the RSCG algorithm to analyze computational and communication costs. The model is validated using experimental data and then used to examine and predict behavior of the RSCG algorithm as a function of architecture parameters including communication latency and transmission times and memory access costs.