BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20131120T001500Z
DTEND:20131120T020000Z
LOCATION:Mile High Pre-Function
DESCRIPTION;ENCODING=QUOTED-PRINTABLE: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.
SUMMARY:Towards Benchmarking Graph-Processing Platforms
PRIORITY:3
END:VEVENT
END:VCALENDAR