A scalable eigensolver for large scale-free graphs using 2D graph partitioning

  • Authors:

  • Andy Yoo;Allison H. Baker;Roger Pearce; Van Emden Henson

  • Affiliations:

  • Center for Applied Scientific Computing, Lawrence Livermore National Laboratory;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory;Texas A&M University;Center for Applied Scientific Computing, Lawrence Livermore National Laboratory

  • Venue:
  • Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Eigensolvers are important tools for analyzing and mining useful information from scale-free graphs. Such graphs are used in many applications and can be extremely large. Unfortunately, existing parallel eigensolvers do not scale well for these graphs due to the high communication overhead in the parallel matrix-vector multiplication (MatVec). We develop a MatVec algorithm based on 2D edge partitioning that significantly reduces the communication costs and embed it into a popular eigensolver library. We demonstrate that the enhanced eigensolver can attain two orders of magnitude performance improvement compared to the original on a state-of-art massively parallel machine. We illustrate the performance of the embedded MatVec by computing eigenvalues of a scale-free graph with 300 million vertices and 5 billion edges, the largest scale-free graph analyzed by any in-memory parallel eigensolver, to the best of our knowledge.