Memory Bounds for Concurrent Bounded Queues-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Memory Bounds for Concurrent Bounded Queues

Published:2024-02-20 Issue: Volume: Page:188-199
ISSN:
Container-title:Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming
language:
Short-container-title:

Author:

Aksenov Vitaly¹^ORCID,Koval Nikita²^ORCID,Kuznetsov Petr³^ORCID,Paramonov Anton⁴^ORCID

Affiliation:

1. City, University of London, London, United Kingdom

2. JetBrains, Amsterdam, Netherlands

3. Telecom Paris, Institut Polytechnique Paris, Paris, France

4. EPFL, Lausanne, Switzerland

Funder

TrustShare Innovation Chair (Mazars & CDD)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3627535.3638497

Reference27 articles.

1. [n. d.]. Efficient IO with io_uring. https://kernel.dk/io_uring.pdf.

2. Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, and Anton Paramonov. 2024. Memory Bounds for Concurrent Bounded Queues. arXiv preprint arXiv:2104.15003 (2024).

3. Maya Arbel-Raviv and Trevor Brown. 2017. Reuse, don't recycle: Transforming lock-free algorithms that throw away descriptors. In 31st International Symposium on Distributed Computing (DISC 2017).

4. Hagit Attiya and Jennifer Welch. 2004. Distributed Computing. Fundamentals, Simulations, and Advanced Topics. John Wiley & Sons.

5. Bounds on Shared Memory for Mutual Exclusion

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP