research-article

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity

Authors:

Keren Censor-Hillel,

Faith EllenAuthors Info & Claims

Journal of the ACM (JACM), Volume 62, Issue 1

Article No.: 3, Pages 1 - 22

https://doi.org/10.1145/2732263

Published: 02 March 2015 Publication History

Abstract

This article presents a novel implementation of a snapshot object for n processes, with O(log² b log n) step complexity for update operations and O(log b) step complexity for scan operations, where b is the number of updates. The algorithm uses only reads and writes.

For polynomially many updates, this is an exponential improvement on previous snapshot algorithms, which have linear step complexity. It overcomes the existing Ω(n) lower bound on step complexity by having the step complexity depend on the number of updates. The key to this implementation is the construction of a new object consisting of a pair of max registers that supports a scan operation.

References

[1]

Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. 1993. Atomic snapshots of shared memory. J. ACM 40, 4, 873--890.

Digital Library

[2]

D. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, and S. Gilbert. 2014. Dynamic task allocation in asynchronous shared memory. In Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA). 416--435.

Digital Library

[3]

J. H. Anderson. 1993. Composite Registers. Distrib. Comput. 6, 3, 141--154.

Digital Library

[4]

J. H. Anderson and Mark Moir. 1993. Towards a necessary and sufficient condition for wait-free synchronization. In Proceedings of the 7th International Workshop on Distributed Algorithms (WDAG). Lecture Notes in Computer Science, Vol. 725, Springer, 39--53.

Digital Library

[5]

J. H. Anderson and M. Moir. 1995. Universal Constructions for Large Objects. In Proceedings of the 9th International Workshop on Distributed Algorithms (WDAG). Lecture Notes in Computer Science, vol. 972, Springer, 168--182.

Digital Library

[6]

J. Aspnes, H. Attiya, and K. Censor-Hillel. 2012a. Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59, 1, 2:1--2:24.

Digital Library

[7]

J. Aspnes, H. Attiya, K. Censor-Hillel, and D. Hendler. 2012b. Lower bounds for resricted-use objects. In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). 172--181.

Digital Library

[8]

J. Aspnes and K. Censor. 2009. Approximate shared-memory counting despite a strong adversary. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09). SIAM Philadelphia, PA, 441--450.

Digital Library

[9]

J. Aspnes and M. Herlihy. 1990. Wait-free data structures in the asynchronous PRAM model. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 340--349.

Digital Library

[10]

H. Attiya and A. Fouren. 2001. Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput. 31, 2, 642--664.

Digital Library

[11]

H. Attiya, N. Lynch, and N. Shavit. 1994. Are wait-free algorithms fast&quest; J. ACM 41, 4, 725--763.

Digital Library

[12]

H. Attiya and O. Rachman. 1998. Atomic Snapshots in O(n log n) Operations. SIAM J. Comput. 27, 2, 319--340.

Digital Library

[13]

E. Borowsky and E. Gafni. 1993. Immediate atomic snapshots and fast renaming. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing. 41--51.

Digital Library

[14]

F. E. Fich. 2005. How hard is it to take a snapshot&quest; In Proceedings of 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM). Lecture Notes in Computer Science, vol. 3381, Springer, 27--35.

Digital Library

[15]

M. P. Herlihy and J. M. Wing. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst. 12, 3, 463--492.

Digital Library

[16]

M. Inoue, T. Masuzawa, W. Chen, and N. Tokura. 1994. Linear-Time Snapshot Using Multi-writer Multi-reader Registers. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG). Lecture Notes in Computer Science, vol. 857, Springer, 130--140.

Digital Library

[17]

P. Jayanti. 2002. f-arrays: Implementation and applications. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC). ACM, New York, 270--279.

Digital Library

[18]

P. Jayanti. 2005. An optimal multi-writer snapshot algorithm. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). 723--732.

Digital Library

[19]

P. Jayanti and S. Petrovic. 2005. Efficient wait-free implementation of multiword LL/SC variables. In Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society, 59--68.

Digital Library

[20]

P. Jayanti, K. Tan, and S. Toueg. 2000. Time and space lower bounds for nonblocking implementations. SIAM J. Comput. 30, 2, 438--456.

Digital Library

[21]

Y. Riany, N. Shavit, and D. Touitou. 2001. Towards a practical snapshot algorithm. Theoret. Comput. Sci. 269, 1--2, 163--201.

Cited By

Castañeda ARajsbaum SRaynal M(2023)Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with MultiplicityDistributed Computing10.1007/s00446-022-00440-y36:2(89-106)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1007/s00446-022-00440-y
Bonakdarpour BFraigniaud PRajsbaum SRosenblueth DTravers C(2022)Decentralized Asynchronous Crash-resilient Runtime VerificationJournal of the ACM10.1145/355048369:5(1-31)Online publication date: 10-Aug-2022
https://dl.acm.org/doi/10.1145/3550483
Bashari BWoelfel PMiller ACensor-Hillel K(2021)An Efficient Adaptive Partial Snapshot ImplementationProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467939(545-555)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467939
Show More Cited By

Index Terms

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity

Recommendations

Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity
PODC '20: Proceedings of the 39th Symposium on Principles of Distributed Computing

We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads ...
Faster than optimal snapshots (for a while): preliminary version
PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing

This paper presents a novel implementation of a snapshot object for n processes, with O(log²blogn) step complexity for update operations and O(logb) step complexity for scan operations, where b is the number of updates. The algorithm uses only reads and ...
Long-lived counters with polylogarithmic amortized step complexity
Abstract
A shared-memory counter is a widely-used and well-studied concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. In Jayanti et al (SIAM J Comput, 30(2), ... $^{}$ $^{}$

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 62, Issue 1

February 2015

264 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/2742144

Editor:
Victor Vianu
University of California, San Diego

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 March 2015

Accepted: 01 July 2014

Revised: 01 June 2014

Received: 01 May 2013

Published in JACM Volume 62, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Yad-Hanadiv foundation
Simons Postdoctoral Fellows Program
Natural Science and Engineering Research Council of Canada
NSF
Israel Science Foundation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
337
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Castañeda ARajsbaum SRaynal M(2023)Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with MultiplicityDistributed Computing10.1007/s00446-022-00440-y36:2(89-106)Online publication date: 1-Jun-2023
https://dl.acm.org/doi/10.1007/s00446-022-00440-y
Bonakdarpour BFraigniaud PRajsbaum SRosenblueth DTravers C(2022)Decentralized Asynchronous Crash-resilient Runtime VerificationJournal of the ACM10.1145/355048369:5(1-31)Online publication date: 10-Aug-2022
https://dl.acm.org/doi/10.1145/3550483
Bashari BWoelfel PMiller ACensor-Hillel K(2021)An Efficient Adaptive Partial Snapshot ImplementationProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467939(545-555)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467939
Ovens SMiller ACensor-Hillel K(2021)The Space Complexity of Scannable Binary ObjectsProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467916(509-519)Online publication date: 21-Jul-2021
https://dl.acm.org/doi/10.1145/3465084.3467916
Baig MHendler DMilani ATravers CEmek YCachin C(2020)Long-Lived Snapshots with Polylogarithmic Amortized Step ComplexityProceedings of the 39th Symposium on Principles of Distributed Computing10.1145/3382734.3406005(31-40)Online publication date: 31-Jul-2020
https://dl.acm.org/doi/10.1145/3382734.3406005
Delporte-Gallet CFauconnier HRajsbaum SRaynal M(2018)Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.280955129:9(2033-2045)Online publication date: 1-Sep-2018
https://doi.org/10.1109/TPDS.2018.2809551

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents