Non-blocking Array-Based Algorithms for Stacks and Queues-Reference-Cited by-同舟云学术

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

Non-blocking Array-Based Algorithms for Stacks and Queues

Published:2008 Issue: Volume: Page:55-66
ISSN:0302-9743
Container-title:Distributed Computing and Networking
language:
Short-container-title:

Author:

Shafiei Niloufar

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-92295-7_10

Reference23 articles.

1. Afek, Y., Gafni, E., Morrison, A.: Common2 extended to stacks and unbounded concurrency. In: PODC 2006: Proc. 25th ACM Symposium on Principles of Distributed Computing, pp. 218–227 (2006)

2. Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50(4), 444–468 (2003)

3. Boehm, H.-J.: An almost non-blocking stack. In: Proc. 23th ACM Symp. on Principles of Distributed Computing, pp. 40–49 (2004)

4. Colvin, R., Groves, L.: Formal verification of an array-based nonblocking queue. In: ICECCS 2005: Proc. 10th IEEE International Conference on Engineering of Complex Computer Systems, pp. 507–516 (2005)

5. Lecture Notes in Computer Science;D. Dechev,2006

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A wait-free queue with polylogarithmic step complexity;Distributed Computing;2024-08-17

2. Memory Bounds for Concurrent Bounded Queues;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

3. BQ;Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures;2018-07-11

4. A Portable Lock-Free Bounded Queue;Algorithms and Architectures for Parallel Processing;2016

5. Concurrent Systems: Hybrid Object Implementations and Abortable Objects;Lecture Notes in Computer Science;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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