DBScholar

Back to papers

Adaptive Asynchronous Parallelization of Graph Algorithms

Summary: Adaptive Asynchronous Parallel (AAP) dynamically tunes progress among BSP, AP, and SSP to reduce stragglers and stale work in graph computations. Under GRAPE, AAP unifies these models, optimally simulates MapReduce/PRAM/BSP/AP/SSP, and guarantees convergence for monotone fixpoint algorithms with observed speedups on graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5626
Venue
SIGMOD
Year
2018
Pagerank
5.8250554e-05
Overall Rank
6,599 | 54.73%
DOI
10.1145/3183713.3196918

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fan_sigmod18,
        title = {{Adaptive Asynchronous Parallelization of Graph Algorithms}},
        author = {Fan, Wenfei and Lu, Ping and Luo, Xiaojian and Xu, Jingbo and Yin, Qiang and Yu, Wenyuan and Xu, Ruiqi},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3196918},
        url = {https://dl.acm.org/doi/10.1145/3183713.3196918},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers