Experiments on Asynchronous Partial Gauss-Seidel Method
This paper presents design and experimental results of a parallel linear equation solver by asynchronous partial Gauss-Seidel method. The basic idea of this method is derived from the asynchronous iterative method; newly computed values of unknowns are broadcast to all other processors and are incorporated into computing the next value immediately after they are received. However, since the asynchronous iterative method requires frequent data passing, it is difficult to achieve high performance on practical cluster computing systems due to its enormous communication overhead. To avoid it, the asynchronous partial Gauss-Seidel method reduces frequency of broadcasting new values of unknowns by passing multiple values in a chunk. The experimental results show the advantage of the asynchronous partial Gauss-Seidel method.
Unable to display preview. Download preview PDF.
- 3.Wilkinson, B., Allen, M.: PARALLEL PROGRAMMING, Techniques and Applications Using Networked Workstations and Parallel Computers, 2nd edn., vol. Ch.6 and Ch.11 (2004)Google Scholar
- 5.Lu, E.J., Hilgers, M.G., McMillin, B.: Asynchronous Parallel Schemes: A Survey, Technical Report, Computer Science Department, University of Missouri - Rolla (1993)Google Scholar
- 7.Christen, P.: A parallel iterative linear system solver with dynamic load balancing. In: Proceedings of the 12th international conference on Supercomputing, Melbourne, Australia, pp. 7–12 (1998)Google Scholar