Jun 18, 2021 · In this paper, we introduce SAGE, a self-adaptive graph traversal on GPUs, which is free from preprocessing and operates on ubiquitous graph ...
Jun 25, 2021 · Meanwhile, SAGE is self-adaptive and optimized for GPU's hardware characteristics, based on the graph access patterns of the processed workload.
In this paper, we introduce SAGE, a self-adaptive graph traversal on GPUs, which is free from preprocessing and operates on ubiquitous graph representations ...
Jun 25, 2021 · Motivated by the aforementioned drawbacks, we propose SAGE, a framework that enables self-adaptive graph traversal to support efficient graph ...
This paper introduces SAGE, a self- Adaptive graph traversal on GPUs, which is free from preprocessing and operates on ubiquitous graph representations ...
Request PDF | On Jun 9, 2021, Mo Sha and others published Self-adaptive Graph Traversal on GPUs | Find, read and cite all the research you need on ...
Mo Sha, Yuchen Li, and Kian-Lee Tan. Self-adaptive Graph Traversal on GPUs. PDF Video1 Video2 International Conference on Management of Data (SIGMOD), 2021 ...
People also ask
What is the best graph traversal algorithm?
What is graph traversal in DSA?
This is a project to collect and share related papers on graph processing by the iDC-NEU team. Papers can be systematic or algorithmic.
Self-adaptive graph traversal on gpus. M Sha, Y Li, KL Tan. Proceedings of the 2021 International Conference on Management of Data, 1558 …, 2021. 9, 2021 ; River ...
May 29, 2023 · In practice, we propose a self-adaptive strategy to find the desirable density threshold π. We define the time period between the two ...