GraphBIG
Authors:
Open Access
- 15 November 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Abstract
With the emergence of data science, graph computing is becoming a crucial tool for processing big connected data. Although efficient implementations of specific graph applications exist, the behavior of full-spectrum graph computing remains unknown. To understand graph computing, we must consider multiple graph computation types, graph frameworks, data representations, and various data sources in a holistic way. In this paper, we present GraphBIG, a benchmark suite inspired by IBM System G project. To cover major graph computation types and data sources, GraphBIG selects representative datastructures, workloads and data sets from 21 real-world use cases of multiple application domains. We characterized GraphBIG on real machines and observed extremely irregular memory patterns and significant diverse behavior across different computations. GraphBIG helps users understand the impact of modern graph computing on the hardware architecture and enables future architecture and system research.Keywords
This publication has 32 references indexed in Scilit:
- Near-Data Processing: Insights from a MICRO-46 WorkshopIEEE Micro, 2014
- S3G2: A Scalable Structure-Correlated Social Graph Generator2013
- Distributed GraphLabProceedings of the VLDB Endowment, 2012
- Centralities in Large Networks: Algorithms and Observations2011
- Learning Deep Architectures for AIFoundations and Trends in Machine Learning, 2009
- Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors2005
- Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study2005
- A Parallel Graph Coloring HeuristicSIAM Journal on Scientific Computing, 1993
- Parallel graph algorithmsACM Computing Surveys, 1984
- Smallest-last ordering and clustering and graph coloring algorithmsJournal of the ACM, 1983