Abstract
A randomized construction of unbounded snapshots objects from atomic registers is given. The cost of each snapshot operation is O(log3 n) atomic register steps with high probability, where n is the number of processes, even against an adaptive adversary. This is an exponential improvement on the linear cost of the previous best known unrestricted snapshot construction [7,8] and on the linear lower bound for deterministic constructions [9], and does not require limiting the number of updates as in previous sublinear constructions [4]. One of the main ingredients in the construction is a novel randomized helping technique that allows out-of-date processes to obtain up-to-date information without running into covering lower bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873–890 (1993)
Anderson, J.H.: Multi-writer composite registers. Distributed Computing 7(4), 175–195 (1994)
Aspnes, J., Attiya, H., Censor-Hillel, K.: Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1), 2:1–2:24 (2012)
Aspnes, J., Attiya, H., Censor-Hillel, K., Ellen, F.: Faster than optimal snapshots (for a while). In: 2012 ACM Symposium on Principles of Distributed Computing, pp. 375–384 (July 2012)
Aspnes, J., Attiya, H., Censor-Hillel, K., Hendler, D.: Lower bounds for restricted-use objects. In: Twenty-Fourth ACM Symposium on Parallel Algorithms and Architectures, pp. 172–181 (June 2012)
Aspnes, J., Herlihy, M.: Wait-free data structures in the asynchronous PRAM model. In: Second Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 340–349 (July 1990)
Attiya, H., Fouren, A.: Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput. 31(2), 642–664 (2001)
Inoue, M., Chen, W.: Linear-time snapshot using multi-writer multi-reader registers. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 130–140. Springer, Heidelberg (1994)
Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing 30(2), 438–456 (2000)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aspnes, J., Censor-Hillel, K. (2013). Atomic Snapshots in O(log3 n) Steps Using Randomized Helping. In: Afek, Y. (eds) Distributed Computing. DISC 2013. Lecture Notes in Computer Science, vol 8205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41527-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-41527-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41526-5
Online ISBN: 978-3-642-41527-2
eBook Packages: Computer ScienceComputer Science (R0)