Brief Announcement: Efficient Recoverable Writable-CAS

Author:

Jayanti Prasad1ORCID,Jayanti Siddhartha Visveswara23ORCID,Jayanti Sucharita4ORCID

Affiliation:

1. Dartmouth College, Hanover, New Hampshire, USA

2. Google Research, Atlanta, Georgia, United States of America

3. MIT, Cambridge, Massachusetts, USA

4. Brown University, Providence, Rhode Island, United States of America

Funder

Department of Defense

Publisher

ACM

Reference9 articles.

1. Zahra Aghazadeh , Wojciech Golab , and Philipp Woelfel . 2014 . Making Objects Writable . In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing ( Paris, France) (PODC '14). Association for Computing Machinery, New York, NY, USA, 385--395. 10.1145/2611462.2611483 Zahra Aghazadeh, Wojciech Golab, and Philipp Woelfel. 2014. Making Objects Writable. In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing (Paris, France) (PODC '14). Association for Computing Machinery, New York, NY, USA, 385--395. 10.1145/2611462.2611483

2. Hagit Attiya , Ohad Ben-Baruch , and Danny Hendler . 2018 . Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory . In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing ( Egham, United Kingdom) (PODC '18). Association for Computing Machinery, New York, NY, USA, 7--16. 10.1145/3212734.3212753 Hagit Attiya, Ohad Ben-Baruch, and Danny Hendler. 2018. Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Egham, United Kingdom) (PODC '18). Association for Computing Machinery, New York, NY, USA, 7--16. 10.1145/3212734.3212753

3. Ohad Ben-Baruch , Danny Hendler , and Matan Rusanovsky . 2020 . Upper and Lower Bounds on the Space Complexity of Detectable Objects . In Proceedings of the 39th Symposium on Principles of Distributed Computing ( Virtual Event, Italy) (PODC '20). Association for Computing Machinery, New York, NY, USA, 11--20. 10.1145/3382734.3405725 Ohad Ben-Baruch, Danny Hendler, and Matan Rusanovsky. 2020. Upper and Lower Bounds on the Space Complexity of Detectable Objects. In Proceedings of the 39th Symposium on Principles of Distributed Computing (Virtual Event, Italy) (PODC '20). Association for Computing Machinery, New York, NY, USA, 11--20. 10.1145/3382734.3405725

4. Naama Ben-David , Guy E. Blelloch , Michal Friedman , and Yuanhao Wei . 2019 . Delay-Free Concurrency on Faulty Persistent Memory. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures ( Phoenix, AZ, USA) (SPAA '19). Association for Computing Machinery, New York, NY, USA, 253--264. 10.1145/3323165.3323187 Naama Ben-David, Guy E. Blelloch, Michal Friedman, and Yuanhao Wei. 2019. Delay-Free Concurrency on Faulty Persistent Memory. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (Phoenix, AZ, USA) (SPAA '19). Association for Computing Machinery, New York, NY, USA, 253--264. 10.1145/3323165.3323187

5. Ryan Berryhill , Wojciech M. Golab , and Mahesh Tripunitara . 2015 . Robust Shared Objects for Non-Volatile Main Memory. In 19th International Conference on Principles of Distributed Systems, OPODIS 2015 , December 14 --17 , 2015, Rennes, France (LIPIcs, Vol. 46), Emmanuelle Anceaume, Christian Cachin, and Maria Gradinariu Potop-Butucaru (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 20:1--20: 17 . 10.4230/LIPIcs.OPODIS.2015.20 Ryan Berryhill, Wojciech M. Golab, and Mahesh Tripunitara. 2015. Robust Shared Objects for Non-Volatile Main Memory. In 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14--17, 2015, Rennes, France (LIPIcs, Vol. 46), Emmanuelle Anceaume, Christian Cachin, and Maria Gradinariu Potop-Butucaru (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 20:1--20:17. 10.4230/LIPIcs.OPODIS.2015.20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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