The International Conference for High Performance Computing, Networking, Storage and Analysis
Towards Benchmarking Graph-Processing Platforms.
Authors: Yong Guo (Delft University of Technology), Marcin Biczak (Delft University of Technology), Ana Lucia Varbanescu (University of Amsterdam), Alexandru Iosup (Delft University of Technology), Claudio Martella (VU University Amsterdam), Theodore L. Willke (Intel Corporation)
Abstract: Graph-processing platforms are increasingly used in a variety of domains. Although both industry and academia are developing and tuning graph-processing algorithms and platforms, the performance of graph-processing platforms has never been explored or compared in-depth. Thus, users face the daunting challenge of selecting an appropriate plat- form for their specific application. To alleviate this challenge, we propose an empirical method for benchmarking graph-processing platforms. We implement a benchmark- ing suite, which includes a comprehensive process and a selection of representative metrics, datasets, and algorithmic classes. In our process, we focus on evaluating basic performance, resource utilization, scalability, and overhead. Our selection includes 5 classes of algorithms and 7 graphs. We use our suite on 6 platforms and, besides valuable insights gained for each platform, we also present the first comprehensive comparison of graph-processing platforms.