Fetching the paper…
Reading the bibliography…
We present a graph processing benchmark suite with the goal of helping to standardize graph processing evaluations.
On random graphs. I
Paul Erdős and Alfréd Réyni · 1959
Earlier work this paper cites.
An o o (log n n ) parallel connectivity algorithm
Yossi Shiloach and Uzi Vishkin · 1982
Earlier work this paper cites.
Design patterns: Elements of reusable object-oriented software
Ralph Johnson, Erich Gamma, Richard Helm, and John Vlissides · 1995
Earlier work this paper cites.
METIS–unstructured graph partitioning and sparse matrix ordering system. version 2.0
George Karypis and Vipin Kumar · 1995
Earlier work this paper cites.
The matrix market exchange formats: Initial design
Ronald F Boisvert, Roldan Pozo, and Karin A Remington · 1996
Earlier work this paper cites.
A faster algorithm for betweenness centrality
Ulrik Brandes · 2001
Earlier work this paper cites.
δ \delta -stepping: a parallelizable shortest path algorithm
Ulrich Meyer and Peter Sanders · 2003
Earlier work this paper cites.
On the architectural requirements for efficient execution of graph algorithms
David A Bader, Guojing Cong, and John Feo · 2005
Earlier work this paper cites.
Realistic, mathematically tractable graph generation and evolution, using Kronecker multiplication
Jurij Leskovec, Deepayan Chakrabarti, Jon Kleinberg, and Christos Faloutsos · 2005
Earlier work this paper cites.
Effective C++: 55 specific ways to improve your programs and designs
Scott Meyers · 2005
Earlier work this paper cites.
http://www.dis.uniroma1.it/challenge9/
9th DIMACS implementation challenge - shortest paths · 2006
Cited alongside, same era.
An experimental study of a parallel shortest path algorithm for solving large-scale graph instances
Kamesh Madduri, David A Bader, Jonathan W Berry, and Joseph R Crobak · 2007
Cited alongside, same era.
A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
Kamesh Madduri, David Ediger, Karl Jiang, David A Bader, and Daniel Chavarria-Miranda · 2009
Cited alongside, same era.
www.cc.gatech.edu/~jriedy/tmp/graph500
Graph500 SSSP proposal · 2010
Cited alongside, same era.
What is Twitter, a social network or a news media?
Haewoon Kwak, Changhyun Lee, Hosung Park, and Sue Moon · 2010
Cited alongside, same era.
Searching for a parent instead of fighting over children: A fast breadth-first search implementation for Graph500
Brief announcement: the problem based benchmark suite
Julian Shun, Guy E Blelloch, Jeremy T Fineman, Phillip B Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, and Kanat Tangwongsan · 2012
Later among the works it cites.
A lightweight infrastructure for graph analytics
Donald Nguyen, Andrew Lenharth, and Keshav Pingali · 2013
Later among the works it cites.
Ligra: a lightweight graph processing framework for shared memory
Julian Shun and Guy E Blelloch · 2013
Later among the works it cites.
Performance analysis of single-source shortest path algorithms on distributed-memory systems
Thap Panitanarak and Kamesh Madduri · 2014
Later among the works it cites.
Locality exists in graph processing: Workload characterization on an Ivy Bridge server
Scott Beamer, Krste Asanović, and David A. Patterson · 2015
Closest in time.
Scalability! but at what COST?
Frank McSherry, Michael Isard, and Derek G Murray · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Scott Beamer, Krste Asanović, and David Patterson · 2011
Cited alongside, same era.
Triangle listing in massive networks and its applications
Shumo Chu and James Cheng · 2011
Cited alongside, same era.
The University of Florida sparse matrix collection
Timothy Davis and Yifan Hu · 2011
Cited alongside, same era.
Direction-optimizing breadth-first search
Scott Beamer, Krste Asanović, and David A. Patterson · 2012
Cited alongside, same era.
Scalable GPU graph traversal
Duane Merrill, Michael Garland, and Andrew Grimshaw · 2012
Cited alongside, same era.
https://github.com/sbeamer/gapbs
GAP benchmark suite reference code v1.0
Cited in the paper.
www.graph500.org
Graph500 benchmark
Cited in the paper.
Closest in time.
GraphMat: High performance graph analytics made productive
Narayanan Sundaram, Nadathur Rajagopalan Satish, Md Mostofa Ali Patwary, Subramanya R Dulloor, Satya Gautam Vadlamudi, Dipankar Das, and Pradeep Dubey · 2015
Closest in time.
Understanding and Improving Graph Algorithm Performance
Scott Beamer · 2016
Closest in time.
google.github.io/styleguide/cppguide.html
Google C++ style guide · 2016
Closest in time.