Advertisement

Experiments on Asynchronous Partial Gauss-Seidel Method

  • Hiroshi Nishida
  • Hairong Kuang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3756)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chazan, D., Miranker, W.: Chaotic Relaxation. Linear Algebra and its Applications 2, 199–222 (1969)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Baudet, G.M.: Asynchronous Iterative Methods for Multiprocessors. Journal of the Association for Computing Machinery 25(2), 226–244 (1978)zbMATHMathSciNetGoogle Scholar
  3. 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
  4. 4.
    Blathras, K., Szyld, D.B., Shi, Y.: Timing Models and Local Stopping Criteria for Asynchronous Iterative Algorithms. Journal of Parallel and Distributed Computing 58, 446–465 (1999)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Strikwerda, J.C.: A Convergence Theorem for Chaotic Asynchronous Relaxation. Linear Algorithms and Applications 253, 15–24 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 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
  8. 8.
    Matsumoto, M., Nishimura, T., Twister, M.: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Transactions on Modeling and Computer Simulation (TOMACS), Special issue on uniform random number generation 8(1), 3–30 (1998)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hiroshi Nishida
    • 1
  • Hairong Kuang
    • 1
  1. 1.Computer Science DepartmentCalifornia State Polytechnic UniversityPomonaUSA

Personalised recommendations