Abstract

GPUs (Graphics processing units) have been increasingly adopted for large-scale graph processing by exploiting the inherent parallelism. There have been many efforts in designing specialized graph analytics and generalized frameworks. The two classes of graph processing systems share some common design choices, and often make specific trade-offs. However, there is no characterization study that provides an in-depth understanding of both approaches. In this paper, we analyze two GPU-based graph processing systems (Enterprise and Gunrock) from the perspective of breadth-first graph traversal. We conduct both high-level performance comparison and low-level characteristic evaluation such as workload balancing, synchronization, and memory subsystem. We investigate the differences based on 10 real-world and synthetic graphs. Our results reveal some uncommon findings that would be beneficial to the research and development of large-scale graph processing on GPUs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call