Reordering computations for parallel execution
Loyce M. Adams · Communications in Applied Numerical Methods · 1986
Abstract In this paper, we show how to reorder the computations in the SOR algorithm to maintain the same asymptotic rate of convergence as the rowwise ordering and to obtain parallelism at different levels. A parallel program is written to illustrate these ideas and actual machines for implementation of this program are discussed.