Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

European Conference on Parallel Processing

Euro-Par 2011: Euro-Par 2011: Parallel Processing Workshops pp 345–354Cite as

  1. Home
  2. Euro-Par 2011: Parallel Processing Workshops
  3. Conference paper
A Communication-Avoiding Thick-Restart Lanczos Method on a Distributed-Memory System

A Communication-Avoiding Thick-Restart Lanczos Method on a Distributed-Memory System

  • Ichitaro Yamazaki30 &
  • Kesheng Wu30 
  • Conference paper
  • 1336 Accesses

  • 1 Citations

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7155)

Abstract

The Thick-Restart Lanczos (TRLan) method is an effective method for solving large-scale Hermitian eigenvalue problems. On a modern computer, communication can dominate the solution time of TRLan. To enhance the performance of TRLan, we develop CA-TRLan that integrates communication-avoiding techniques into TRLan. To study the numerical stability and solution time of CA-TRLan, we conduct numerical experiments using both synthetic diagonal matrices and matrices from the University of Florida sparse matrix collection. Our experimental results on up to 1,024 processors of a distributed-memory system demonstrate that CA-TRLan can achieve speedups of up to three over TRLan while maintaining numerical stability.

Keywords

  • thick-restart Lanczos
  • communication-avoiding

Download conference paper PDF

References

  1. Bai, Z., Hu, D., Reichel, L.: A Newton basis GMRES implementation. IMA Journal of Numerical Analysis 14, 563–581 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Carson, E., Knight, N., Demmel, J.: Hypergraph partitioning for computing matrix powers. In: The Proceedings of SIAM Workshop on Combinatorial Scientific Computing (2011)

    Google Scholar 

  3. Demmel, J., Grigori, L., Hoemmen, M., Langou, J.: Communication-optimal parallel and sequential QR and LU factorizations. Technical Report UCB/EECS-2008-89, EECS Department, University of California, Berkeley (2008)

    Google Scholar 

  4. Demmel, J., Hoemmen, M., Mohiyuddin, M., Yelick, K.: Avoiding communication in sparse matrix computations. In: The Proceedings of IEEE International Symposium on Parallel and Distributed Processing (IPDPS), pp. 1–12 (2008)

    Google Scholar 

  5. Hoemmen, M.: Communication-avoiding Krylov subspace methods. PhD thesis, University of California, Berkeley (2010)

    Google Scholar 

  6. Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand. 45, 255–281 (1950)

    MathSciNet  Google Scholar 

  7. Parlett, B.: The symmetric eigenvalue problem. Classics in Applied Mathematics. SIAM, Philadelphia (1998)

    CrossRef  Google Scholar 

  8. Saad, Y.: Numerical Methods for Large Eigenvalue Problems, 2nd edn. Classics in Applied Mathematics. SIAM, Philadelphia (2003)

    Google Scholar 

  9. Stathopoulos, A., Wu, K.: A block orthogonalization procedure with constant synchronization requirements. SIAM J. Sci. Comput. 23, 2165–2182 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Vuduc, R., Demmel, J., Yelick, K.: OSKI: A library of automatically tuned sparse matrix kernels. In: Proc. SciDAC, J. Physics: Conf. Ser., vol. 16, pp. 521–530 (2005), http://bebop.cs.berkeley.edu/oski/

  11. Wu, K., Simon, H.: Thick-restart Lanczos method for large symmetric eigenvalue problems. SIAM J. Mat. Anal. Appl. 22, 602–616 (2000)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Yamazaki, I., Bai, Z., Simon, H., Wand, L.-W., Wu, K.: Adaptive projection subspace dimension for the thick-restart Lanczos method. ACM Trans. Math. Softw. 37 (2010), https://codeforge.lbl.gov/projects/trlan/

Download references

Author information

Authors and Affiliations

  1. Lawrence Berkeley National Laboratory, Berkeley, CA, USA

    Ichitaro Yamazaki & Kesheng Wu

Authors
  1. Ichitaro Yamazaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kesheng Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Scilytics, Koellnerhofgasse 3/15A, 1010, Vienna, Austria

    Michael Alexander

  2. ICAR-CNR, Via P. Castellino, 111, 80131, Napoli, Italy

    Pasqua D’Ambra

  3. University of Amsterdam, 1090, Amsterdam, Netherlands

    Adam Belloum

  4. Innovative Computing Laboratory, The University of Tennessee, USA

    George Bosilca

  5. Department of Experimental Medicine and Clinic, University Magna Græcia, 88100, Catanzaro, Italy

    Mario Cannataro

  6. Computer Science Department, University of Pisa, Italy

    Marco Danelutto

  7. Second University of Naples, Italy

    Beniamino Di Martino

  8. TU München, Boltzmannstr. 3, 85748, Garching, Germany

    Michael Gerndt

  9. Equipe Runtime, INRIA Bordeaux Sud-Ouest, 33405, Talence Cedex, France

    Emmanuel Jeannot & Raymond Namyst & 

  10. Equipe HIEPACS, INRIA Bordeaux Sud-Ouest, 33405, Talence Cedex, France

    Jean Roman

  11. Oak Ridge National Laboratory, Computer Science and Mathematics Division, 37831-6164, Oak Ridge, TN, USA

    Stephen L. Scott

  12. Department of Scientific Computing, University of Vienna, Nordbergstr. 15/3C, 1090, Vienna, Austrial

    Jesper Larsson Traff

  13. Computer Science and Mathematics Division, Oak Ridge National Laboratory, 37831, Oak Ridge, TN, USA

    Geoffroy Vallée

  14. Technische Universität München, Germany

    Josef Weidendorfer

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamazaki, I., Wu, K. (2012). A Communication-Avoiding Thick-Restart Lanczos Method on a Distributed-Memory System. In: Alexander, M., et al. Euro-Par 2011: Parallel Processing Workshops. Euro-Par 2011. Lecture Notes in Computer Science, vol 7155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29737-3_39

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-29737-3_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29736-6

  • Online ISBN: 978-3-642-29737-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature