Skip to main content
SpringerLink
Log in
Book cover

International Conference of the Austrian Center for Parallel Computation

ACPC 1999: Parallel Computation pp 13–27Cite as

Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1557))

Abstract

A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domai n-decomposition type method in which a processor is assigned a certain number of rows of the linear system to be solved. Strategies that are discussed include non-standard graph partitioners, and a forced loadbalance technique for the local iterations. A common practice when partitioning a graph is to seek to minimize the number of cut-edges and to have an equal number of equations per processor. It is shown that partitioners that take into account the values of the matrix entries may be more effective.

Work supported by NSF under grant CCR-9618827, and in part by the Minnesota Supercomputer Institute.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. X. C. Cai and Y. Saad. Overlapping domain decomposition algorithms for general sparse matrices. Numerical Linear Algebra with Applications, 3:221–237, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  2. I. S. Duff, R. G. Grimes, and J. G. Lewis. Sparse matrix test problems. ACM Transactions on Mathematical Software, 15:1–14, 1989.

    Article  MATH  Google Scholar 

  3. V. Eijkhout and T. Chan. ParPre a parallel preconditioners package, reference manual for version 2.0.17. Technical Report CAM Report 97-24, UCLA, 1997.

    Google Scholar 

  4. C. Farhat and M. Lesoinne. Mesh partitioning algorithms for the parallel solution of partial differential equations. Applied Numerical Mathematics, 12, 1993.

    Google Scholar 

  5. J. A. George and J. W. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs, NJ, 1981.

    MATH  Google Scholar 

  6. T. Goehring and Y. Saad. Heuristic algorithms for automatic graph partitioning. Technical Report UMSI 94-29, University of Minnesota Supercomputer Institute, Minneapolis, MN, February 1994.

    Google Scholar 

  7. B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. Technical Report SAND92-1460, UC-405, Sandia National Laboratories, Albuquerque, NM, 1992.

    Google Scholar 

  8. Scott A. Hutchinson, John N. Shadid, and R. S. Tuminaro. Aztec user’s guide. version 1.0. Technical Report SAND95-1559, Sandia National Laboratories, Albuquerque, NM, 1995.

    Google Scholar 

  9. M. T. Jones and P. E. Plassmann. BlockSolve95 users manual: Scalable library software for the solution of sparse linear systems. Technical Report ANL-95/48, Argonne National Lab., Argonne,IL., 1995.

    Google Scholar 

  10. G. Karypis. Graph Partitioning and its Applications to Scientific Computing. PhD thesis, Department of Computer Science, University of Minnesota, Minneapolis, MN, 1996.

    Google Scholar 

  11. S. Kuznetsov, G. C. Lo, and Y. Saad. Parallel solution of general sparse linear systems. Technical Report UMSI 97/98, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 1997.

    Google Scholar 

  12. J. W. H. Liu. A graph partitioning algorithm by node separators. ACM Transactions on Mathematical Software, 15:198–219, 1989.

    Article  MATH  Google Scholar 

  13. A. Pothen, H. D. Simon, and K. P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 11:430–452, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  14. Y. Saad. Parallel sparse matrix library (P_SPARSLIB): The iterative solvers module. In Advances in Numerical Methods for Large Sparse Sets of Linear Equations, Number 10, Matrix Analysis and Parallel Computing, PCG 94, pages 263–276, Keio University, Yokohama, Japan, 1994.

    Google Scholar 

  15. Y. Saad. Iterative Methods for Sparse Linear Systems. PWS publishing, New York, 1996.

    MATH  Google Scholar 

  16. Y. Saad and A. Malevsky. PSPARSLIB: A portable library of distributed memory sparse iterative solvers. In V. E. Malyshkin et al., editor, Proceedings of Parallel Computing Technologies (PaCT-95), 3-rd international conference, St. Petersburg, Russia, Sept. 1995, 1995.

    Google Scholar 

  17. Y. Saad and M. Sosonkina. Distributed Schur complement techniques for general sparse linear systems. Technical Report UMSI 97/159, Minnesota Supercomputer Institute, University of Minnesota, Minneapolis, MN, 1997. Submitted, Revised.

    Google Scholar 

  18. B. Smith, P. Bjørstad, and W. Gropp. Domain decomposition: Parallel multilevel methods for elliptic partial differential equations. Cambridge University Press, New-York,NY, 1996.

    MATH  Google Scholar 

  19. B. Smith, W. D. Gropp, and L. C. McInnes. PETSc 2.0 user’s manual. Technical Report ANL-95/11, Argonne National Laboratory, Argonne, IL, July 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MM 55455, USA

    Yousef Saad

  2. Department of Computer Science, University of Minnesota, Duluth, 320 Heller Hall, 10 University Drive, Duluth, Minnesota, 55812-2496

    Maria Sosonkina

Authors
  1. Yousef Saad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Sosonkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Forschungsinstitut für Softwaretechnologie, Hellbrunnerstr. 34, A-5020, Salzburg, Austria

    Peter Zinterhof

  2. Slovac Academy of Sciences, Institute of Mathematics, Laboratory for Informatics, Dubravska 9, P.O.Box 56, 840 00, Bratislava, Slovakia

    Marian Vajteršic

  3. Universität Salzburg, RIST++, Hellbrunnerstr. 34, A-5020, Salzburg, Austria

    Andreas Uhl

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saad, Y., Sosonkina, M. (1999). Non-standard Parallel Solution Strategies for Distributed Sparse Linear Systems. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-49164-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65641-8

  • Online ISBN: 978-3-540-49164-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation