{"title":"Specialization or generalization: A study on breadth-first graph traversal on GPUs","authors":"Wenyong Zhong, Yanxin Cao, Jiawen Li, Jianhua Sun, Hao Chen","doi":"10.1109/PIC.2017.8359560","DOIUrl":null,"url":null,"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.","PeriodicalId":370588,"journal":{"name":"2017 International Conference on Progress in Informatics and Computing (PIC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Progress in Informatics and Computing (PIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIC.2017.8359560","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
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.