Self-adaptive graph traversal on GPUs

• المؤلفون الرئيسيون: SHA, Mo, LI, Yuchen, TAN, Kian-Lee
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2021
• الموضوعات: Graph Processing; GPGPU; Parallel Task Scheduling; Databases and Information Systems; Theory and Algorithms
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/6201; https://ink.library.smu.edu.sg/context/sis_research/article/7204/viewcontent/3448016.3457279.pdf
• المؤسسة: Singapore Management University

GPU’s massive computing power offers unprecedented opportunities to enable large graph analysis. Existing studies proposed various preprocessing approaches that convert the input graphs into dedicated structures for GPU-based optimizations. However, these dedicated approaches incur significant preprocessing costs as well as weak programmability to build general graph applications. In this paper, we introduce SAGE, a self-adaptive graph traversal on GPUs, which is free from preprocessing and operates on ubiquitous graph representations directly. We propose Tiled Partitioning and Resident Tile Stealing to fully exploit the computing power of GPUs in a runtime and self-adaptive manner. We also propose Sampling-based Reordering to further optimize the memory efficiency of SAGE through a lightweight and effective node reordering technique on the fly. Extensive experiments demonstrate that SAGE can achieve superior graph traversal performance over existing approaches under different architectural scenarios, i.e., singleGPU, out-of-core, and multi-GPU.