Breaking the speed and scalability Barriers for Graph exploration on distributed-memory machines

@article{Checconi2012BreakingTS,
  title={Breaking the speed and scalability Barriers for Graph exploration on distributed-memory machines},
  author={Fabio Checconi and Fabrizio Petrini and Jeremiah Willcock and Andrew Lumsdaine and Anamitra R. Choudhury and Yogish Sabharwal},
  journal={2012 International Conference for High Performance Computing, Networking, Storage and Analysis},
  year={2012},
  pages={1-12}
}
In this paper, we describe the challenges involved in designing a family of highly-efficient Breadth-First Search (BFS) algorithms and in optimizing these algorithms on the latest two generations of Blue Gene machines, Blue Gene/P and Blue Gene/Q. With our recent winning Graph 500 submissions in November 2010, June 2011, and November 2011, we have achieved unprecedented scalability results in both space and size. On Blue Gene/P, we have been able to parallelize a scale 38 problem with 238… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 46 extracted citations

63 Citations

01020'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 63 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…