.png){kind=icon}
.png){kind=icon}
Return
Optimizing GPU-Based Graph Sampling and Random Walk for Efficiency and Scalability
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2023.3251860.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph sampling and random walk algorithms are playing increasingly important roles today because they can significantly reduce graph size while preserving structural information, thus enabling computationally intensive tasks on large-scale graphs. Current frameworks designed for graph sampling and random walk tasks are generally not efficient in terms of memory requirement and throughput. Not to mention that some of them result in biased results. To solve the above problems, we introduce Skywalker+, a high-performance graph sampling and random walk framework on multiple GPUs supporting multiple algorithms. Skywalker+ makes four key contributions: First, it realizes highly paralleled alias method on GPUs. Second, it applies finely adjusted workload-balancing techniques and locality-aware execution modes to present a highly efficient execution engine. Third, it optimizes the GPU memory usage with efficient buffering and data compression schemes. Last, it scales to multi-GPU to further enhance the system throughput. Abundant experiments show that Skywalker+ exhibits significant advantage over the baselines both in performance and utility.
Keywords:
Task analysis
Graphics processing units
Throughput
Optimization
Scalability
Parallel processing
Memory management
GPU graph sampling
graph random walk
scalability
throughput
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K