Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads

Author:

Liu Quanquan C.1ORCID,Shun Julian2ORCID,Zablotchi Igor3ORCID

Affiliation:

1. Yale University, New Haven, USA

2. Massachusetts Institute of Technology, Cambridge, United States of America

3. Mysten Labs, Zürich, Switzerland

Funder

SNSF

DOE U.S. Department of Energy

NSF (National Science Foundation)

Google

Apple

Publisher

ACM

Reference77 articles.

1. Umut A. Acar, Daniel Anderson, Guy E. Blelloch, and Laxman Dhulipala. 2019. Parallel Batch-Dynamic Graph Connectivity. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures. 381--392.

2. Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, and Sam Westrick. 2020. Parallel Batch-Dynamic Trees via Change Propagation. In Annual European Symposium on Algorithms, Vol. 173. 2:1--2:23.

3. Atomic snapshots of shared memory

4. Provably good scheduling for parallel programs that use data structures through implicit batching

5. Vitaly Aksenov, Petr Kuznetsov, and Anatoly Shalyto. 2018. Parallel Combining: Benefits of Explicit Synchronization. In International Conference on Principles of Distributed Systems (OPODIS), Vol. 125. 11:1--11:16.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3