A Wait-free Queue with Polylogarithmic Step Complexity

Author:

Naderibeni Hossein1ORCID,Ruppert Eric1ORCID

Affiliation:

1. York University, Toronto, Ontario, Canada

Funder

Natural Sciences and Engineering Research Council of Canada

Publisher

ACM

Reference43 articles.

1. Yehuda Afek , Dalia Dauber , and Dan Touitou . 1995 . Wait-free made fast . In Proc. 27th ACM Symposium on Theory of Computing. 538--547 . 10.1145/225058.225271 Yehuda Afek, Dalia Dauber, and Dan Touitou. 1995. Wait-free made fast. In Proc. 27th ACM Symposium on Theory of Computing. 538--547. 10.1145/225058.225271

2. Hagit Attiya and Arie Fouren . 2017 . Lower Bounds on the Amortized Time Complexity of Shared Objects. In 21st International Conference on Principles of Distributed Systems (LIPIcs , Vol. 95). 16:1--16: 18 . 10.4230/LIPIcs.OPODIS.2017.16 Hagit Attiya and Arie Fouren. 2017. Lower Bounds on the Amortized Time Complexity of Shared Objects. In 21st International Conference on Principles of Distributed Systems (LIPIcs, Vol. 95). 16:1--16:18. 10.4230/LIPIcs.OPODIS.2017.16

3. Benyamin Bashari and Philipp Woelfel . 2021 . An Efficient Adaptive Partial Snapshot Implementation . In Proc. ACM Symposium on Principles of Distributed Computing. 545--555 . 10.1145/3465084.3467939 Benyamin Bashari and Philipp Woelfel. 2021. An Efficient Adaptive Partial Snapshot Implementation. In Proc. ACM Symposium on Principles of Distributed Computing. 545--555. 10.1145/3465084.3467939

4. Naama Ben-David , Guy E. Blelloch , Panagiota Fatourou , Eric Ruppert , Yihan Sun , and Yuanhao Wei . 2021 . Space and Time Bounded Multiversion Garbage Collection . In Proc. 35th International Symposium on Distributed Computing (LIPIcs , Vol. 209). 12:1--12: 20 . 10.4230/LIPIcs.DISC.2021.12 Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, and Yuanhao Wei. 2021. Space and Time Bounded Multiversion Garbage Collection. In Proc. 35th International Symposium on Distributed Computing (LIPIcs, Vol. 209). 12:1--12:20. 10.4230/LIPIcs.DISC.2021.12

5. An almost optimal algorithm for unbounded searching

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

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

2. Lower Bounds on the Amortized Time Complexity of Shared Objects;Theory of Computing Systems;2024-07-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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