A New Benchmark For Evaluation Of Graph-Theoretic Algorithms

We propose a new graph-theoretic benchmark in this paper. The benchmark is developed to address shortcomings of an existing widely-used graph benchmark. We thoroughly studied a large number of traditional and contemporary graph algorithms reported in the literature to have clear understanding of their algorithmic and run-time characteristics. Based on this study, we designed a suite of kernels, each of which represents a specific class of graph algorithms. The kernels are designed to capture the typical run-time behavior of target algorithms accurately, while limiting computational and spatial overhead to ensure its computation finishes in reasonable time. We expect that the developed benchmark will serve as a much needed tool for evaluating different architectures and programming models to run graph algorithms.

[1]  A. Vázquez.  Statistics of citation networks , 2001, cond-mat/0105031.

[2]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[3]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Andy B. Yoo,et al.  Parallel massive scale-free graph generators , 2006, SC.

[5]  Michael Doob,et al.  Spectra of graphs , 1980 .

[6]  Jonathan W. Berry,et al.  Challenges in Parallel Graph Processing , 2007, Parallel Process. Lett..

[7]  Deepayan Chakrabarti,et al.  AutoPart: Parameter-Free Graph Partitioning and Outlier Detection , 2004, PKDD.

[8]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Willem H. Haemers,et al.  Spectra of Graphs , 2011 .

[10]  Ramesh Govindan,et al.  Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  David A. Bader,et al.  Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors , 2005, HiPC.

[12]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  R Pastor-Satorras,et al.  Dynamical and correlation properties of the internet. , 2001, Physical review letters.

[15]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  S. Bornholdt,et al.  Scale-free topology of e-mail networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  David H. Bailey,et al.  The Nas Parallel Benchmarks , 1991, Int. J. High Perform. Comput. Appl..

[18]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[19]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[20]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[22]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[23]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[24]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[25]  Claude E. Shannon,et al.  Prediction and Entropy of Printed English , 1951 .

[26]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[27]  Maya Gokhale,et al.  Hardware Technologies for High-Performance Data-Intensive Computing , 2008, Computer.

[28]  D. Cvetkovic,et al.  Eigenspaces of graphs: Bibliography , 1997 .

[29]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[31]  Christos Faloutsos,et al.  Random walk with restart: fast solutions and applications , 2008, Knowledge and Information Systems.

[32]  Christos Faloutsos,et al.  R-MAT: A Recursive Model for Graph Mining , 2004, SDM.

[33]  D. Cvetkovic,et al.  Recent Results in the Theory of Graph Spectra , 2012 .

[34]  Edwin R. Hancock,et al.  Eigenspaces for Graphs , 2002, Int. J. Image Graph..

[35]  James Abello,et al.  MGV: A System for Visualizing Massive Multidigraphs , 2002, IEEE Trans. Vis. Comput. Graph..

[36]  C. Tsallis,et al.  Are citations of scientific papers a case of nonextensivity? , 1999, cond-mat/9903433.

[37]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .

[38]  Vicente Hernández,et al.  SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems , 2005, TOMS.

[39]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[40]  S. Redner.  How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.