Abstract
We present a wait-free implementation of the atomic snapshot object on the shared memory system. A snapshot object shared by n processes is a data structure partitioned into n segments such that each process owns one segment. Each process can update its own segment, and instantaneously scan all segments. In our implementation, each object operation requires O(n) operations on atomic multi-writer multi-reader registers.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, J.H.: Composite Registers. Proc. of the 9th ACM Symposium on Principles of Distributed Computing (1990) 15–29.
Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., and Shavit, N.: Atomic Snapshots of Shared Memory. Proc. of the 9th ACM Symposium on Principles of Distributed Computing (1990) 1–13.
Aspnes, J.: Time-and Space-Efficient Randomized Consensus. Proc. of the 9th ACM Symposium on Principles of Distributed Computing (1990) 325–331.
Aspnes, J., and Herlihy, M.: Fast Randomized Consensus Using Shared Memory. Journal of Algorithms 11,(1990) 441–461.
Attiya, H., Dolev, D., and Shavit, N.: Are wait-free algorithms fast? Proc. of the 31th IEEE Symp. on Foundations of Computer Science (1990) 55–64.
Attiya, H., and Rachman, O.: Atomic Snapshots in O(n log n) Operations. Proc. of the 12th ACM Symposium on Principles of Distributed Computing (1993) 29–40.
Attiya, A., Herlihy, M., and Rachman, O.: Efficient Atomic Snapshots Using Lattice Agreement. Proc. of the 6th Int. Workshop on Distributed Algorithms (LNCS 647) (1992) 35–53.
Dwork, C., Herlihy, M., Plotkin, A.S., and Waarts, O.: Time-Lapse Snapshots. Proc. of the Israel Symposium on the Theory of Computing and Systems (LNCS 601) (1992) 154–170.
Gawlick, R., Lynch, N., and Shavit, N.: Concurrent Timestamping Made Simple. Proc. of the Israel Symposium on the Theory of Computing and Systems (LNCS 601) (1992) 171–183.
Herlihy, M.: Wait-Free Synchronization. ACM TOPLAS 13, 1 (1991) 124–149.
Herlihy, M., and Wing, J.: Linearizability: A Correctness Condition for Concurrent Objects. ACM TOPLAS 12, 3 (1990) 463–492.
Hoepman, J.H., and Tromp, J.: Binary Snapshots. Proc. of the 7th Int. Workshop on Distributed Algorithms (1993) 18–25.
Israeli, A., Shaham, A., and Shirazi, A.: Linear-Time Snapshot Protocols for Unbalanced Systems. Proc. of the 7th Int. Workshop on Distributed Algorithms (1993) 26–38.
Kirousis, L.M., Spirakis, P., and Tsigas, P.; Simple Atomic Snapshots: A Linear Complexity Solution With Unbounded Time-Stamps. Proc. of International Conference on Computing and Information (LNCS 497) (1991) 582–587.
Peterson, G.L., and Burns, I.E.: Concurrent Reading While Writing [II]: The Multi-writer Case. Proc. of the 28th Ann. IEEE Symp. on Foundations of Computer Science (1987) 383–392.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inoue, M., Masuzawa, T., Chen, W., Tokura, N. (1994). Linear-time snapshot using multi-writer multi-reader registers. In: Tel, G., Vitányi, P. (eds) Distributed Algorithms. WDAG 1994. Lecture Notes in Computer Science, vol 857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020429
Download citation
DOI: https://doi.org/10.1007/BFb0020429
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58449-0
Online ISBN: 978-3-540-48799-9
eBook Packages: Springer Book Archive