Benchmarking graph-processing platforms: A vision

ICPE 2014 - Proceedings of the 5th ACM/SPEC International Conference on Performance Engineering

Volumn , Issue , 2014, Pages 289-292

  Guo, Yong ^a   Varbanescu, Ana Lucia ^b   Losup, Alexandru ^a   Martella, Claudio ^c   Willke, Theodore L ^d  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

^d INTEL CORPORATION   (United States)

Author keywords

Benchmarking; Experimentation; Graph processing; Performance

Indexed keywords

ENGINEERING RESEARCH;

EXPERIMENTATION; GRAPH PROCESSING; NON-FUNCTIONAL ASPECTS; PERFORMANCE; PERFORMANCE ANALYSIS; PROCESSING GRAPHS; RESEARCH GROUPS; SYSTEM INTEGRATORS;

BENCHMARKING;

EID: 84899669135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2568088.2576761     Document Type: Conference Paper

References (30)

1. DAS4. http://www.cs.vu.nl/das4/.
2. Giraph. http://giraph.apache.org/.
3. Neo4j. http://www.neo4j.org/.
4. SNAP. http://snap.stanford.edu/index.html.
5. YARN. http://hadoop.apache.org/docs/current/hadoop-yarn/hadoop-yarn-site/ YARN.html.
6. D. D. Abreu, A. Flores, G. Palma, V. Pestana, J. Piñero, J. Queipo, J. Sánchez, and M.-E. Vidal. Choosing between graph databases and rdf engines for consuming and mining linked data. In COLD, 2013.
7. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. 1999.
8. A. Buluç, E. Duriakova, A. Fox, J. R. Gilbert, S. Kamil, A. Lugowski, L. Oliker, and S. Williams. High-Productivity and High-Performance Analysis of Filtered Semantic Graphs. In IPDPS, 2013.
9. J. Cai and C. K. Poon. Path-hop: efficiently indexing large graphs for reachability queries. In CIKM, 2010.
10. G. Cong and K. Makarychev. Optimizing Large-scale Graph Analysis on Multithreaded, Multicore Platforms. In IPDPS, 2012.
11. M. Dayarathna and T. Suzumura. Xgdbench: A benchmarking platform for graph stores in exascale clouds. In CloudCom, pages 363-370, 2012.
12. B. Elser and A. Montresor. An evaluation study of bigdata frameworks for graph processing. In IEEE BigData, 2013.
13. S. Ewen, K. Tzoumas, M. Kaufmann, and V. Markl. Spinning fast iterative data flows. PVLDB, 5(11):1268-1279, 2012.
14. B. Ghit, N. Yigitbasi, and D. Epema. Resource Management for Dynamic MapReduce Clusters in Multicluster Systems. In SC|12 MTAGS, 2012. Best paper award.
15. Graph500. http://www.graph500.org/.
16. D. Gregor and A. Lumsdaine. The Parallel BGL: A Generic Library for Distributed Graph Computations. POOSC, 2005.
17. Y. Guo, M. Biczak, A. L. Varbanescu, A. Iosup, C. Martella, and T. L. Willke. How well do graph-processing platforms perform? an empirical performance evaluation and analysis. In IPDPS, 2013. http://www.pds.ewi.tudelft.nl/~iosup/ perf-eval-graph-proc14ipdps.pdf.
18. Y. Guo and A. Iosup. The Game Trace Archive. In NetGames, 2012.
19. W. Jiang and G. Agrawal. Ex-MATE: Data Intensive Computing with Large Reduction Objects and Its Application to Graph Mining. In CCGRID, 2011.
20. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In SIGKDD, 2005.
21. Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola, and J. M. Hellerstein. Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud. In VLDB, pages 716-727, 2012.
22. A. Lugowski, D. M. Alber, A. Buluç, J. R. Gilbert, S. Reinhardt, Y. Teng, and A. Waranis. A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis. In SDM, 2012.
23. G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: A System for Large-scale Graph Processing. In SIGMOD, pages 135-146, 2010.
24. D. Merrill, M. Garland, and A. S. Grimshaw. Scalable GPU graph traversal. In PPOPP, 2012.
25. B. Shao, H. Wang, and Y. Li. Trinity: A distributed graph engine on a memory cloud. In SIGMOD, 2013.
26. J. Shun and G. E. Blelloch. Ligra: a lightweight graph processing framework for shared memory. In PPOPP, 2013.
27. E. Solomonik, A. Buluç, and J. Demmel. Minimizing Communication in All-Pairs Shortest Paths. In IPDPS, 2013.
28. N. Wang, J. Zhang, K.-L. Tan, and A. K. H. Tung. On Triangulation-based Dense Neighborhood Graphs Discovery. VLDB, 2010.
29. T. White. Hadoop: The definitive guide. O'Reilly Media, Inc., 2012.
30. B. Wu and Y. Du. Cloud-Based Connected Component Algorithm. In ICAICI, pages 122-126, 2010.