Parallel SOR Iterative Algorithms and Performance Evaluation On a Linux Cluster
Computing Sciences and Computer Engineering
The successive over-relaxation (SOR) iterative method is an important solver for linear systems. In this paper, a parallel algorithm for the red-black SOR method with domain decomposition is investigated. The parallel SOR algorithm is designed by combining the traditional red-black SOR and row block domain decomposition technique, which reduces the communication cost and simplifies the parallel implementation. Two other iterative methods, Jacobi and Gauss-Seidel(G-S), are also implemented in parallel for comparison. The three parallel iterative algorithm are implemented in C and MPI (Message Passing Interface) for solving the Dirichlet problem on a Linux cluster with eight dual processor 2.6ghz 32 bit Intel Xeons, totaling 16 processors. The performances of the three algorithms are evaluated in terms of speedup and efficiency.
Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05
(2005). Parallel SOR Iterative Algorithms and Performance Evaluation On a Linux Cluster. Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'05, 263-269.
Available at: https://aquila.usm.edu/fac_pubs/17947