Atomic snapshots in O(n log n) Operations

SIAM Journal on Computing

Volumn 27, Issue 2, 1998, Pages 319-340

  Attiya, Hagit ^a   Rachman, Ophir ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Asynchronous shared memory systems; Atomic read; Linearizability; Single reader multiwriter; Snapshot objects; Wait free computations; Write registers

Indexed keywords

EID: 0000438061     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795279463     Document Type: Article

References (24)

1. Y. AFEK, H. ATTIYA, D. DOLEV, E. GAFNI, M. MERRITT, AND N. SHAVIT, Atomic snapshots of shared memory, J. ACM, 40 (1993), pp. 873-890.
2. J. H. ANDERSON, Composite registers, Distrib. Comput., 6 (1993), pp. 141-154.
3. J. ASPNES, Time- and space-efficient randomized consensus, in Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1990, pp. 325-331.
4. J. ASPNES AND M. P. HERLIHY, Wait-free data structures in the asynchronous PRAM model, in Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures, ACM, New York, 1990, pp. 340-349.
5. H. ATTIYA, A. BAR-NOY, AND D. DOLEV, Sharing memory robustly in message-passing systems, in Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1990, pp. 363-376.
6. H. ATTIYA, D. DOLEV, AND N. SHAVIT, Bounded polynomial randomized consensus, in Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, 1989, ACM, New York, pp. 281-293.
7. H. ATTIYA, M. HERLIHY, AND O. RACHMAN, Atomic snapshots using lattice agreement, Distrib. Comput., 8 (1995), pp. 121-132.
8. H. ATTIYA, N. A. LYNCH, AND N. SHAVIT, Are wait-free algorithms fast?, J. ACM, 41 (1994), pp. 725-763.
9. T. CHANDRA AND C. DWORK, Using Consensus to Solve Atomic Snapshots, 1992, manuscript.
10. D. DOLEV AND N. SHAVIT, Bounded concurrent time-stamping, SIAM J. Comput., 26 (1997), pp. 418-455.
11. C. DWORK, private communication.
12. C. DWORK, M. P. HERLIHY, S. A. PLOTKIN, AND O. WAARTS, Time-lapse snapshots, in Proceedings of the Israel Symposium on the Theory of Computing and Systems, Haifa, Israel, 1992, Lecture Notes in Comput. Sci. 601, D. Dolev, Z. Galil, and M. Rodeh, eds., Springer-Verlag, Berlin, pp. 154-170.
13. C. DWORK, M. P. HERLIHY, AND O. WAARTS, Bounded round numbers, in Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, ACM, New York, 1993, pp. 53-64.
14. C. DWORK AND O. WAARTS, Simple and efficient concurrent timestamping or bounded concurrent timestamping are comprehensible, in Proceedings of the 24th ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 655-666.
15. R. GAWLICK, N. LYNCH, AND N. SHAVIT, Concurrent timestamping made simple, in Proceedings of the Israel Symposium on the Theory of Computing and Systems, Haifa, Israel, 1992, Lecture Notes in Comput. Sci. 601, D. Dolev, Z. Galil, and M. Rodeh, eds., Springer-Verlag, Berlin, pp. 171-183.
16. M. P. HERLIHY, Wait-free synchronization, ACM Trans. Programming Lang. Systems, 13 (1991), pp. 124-149.
17. M. P. HERLIHY, Randomized wait-free objects, in Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, ACM, New York, 1991, pp. 11-21.
18. M. P. HERLIHY AND J. M. WING, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Lang. Systems, 12 (1990), pp. 463-492.
19. M. INOUE, W. CHEN, T. MASUZAWA, AND N. TOKURA, Linear-time snapshot using multi-writer multi-reader registers, in Proceedings of the 8th International Workshop on Distributed Algorithms, Terschelling, The Netherlands, 1994, Lecture Notes in Comput. Sci. 857, G. Tel and P. Vitanyi, eds., Springer-Verlag, Berlin, 1994, pp. 130-140.
20. A. ISRAELI AND M. LI, Bounded time stamps, Distrib. Comput., 6 (1987), pp. 205-209.
21. A. ISRAELI AND A. SHIRAZI, Efficient Snapshot Protocol Using 2-Lattice Agreement, 1992, manuscript.
22. A. ISRAELI AND A. SHIRAZI, The time complexity of updating snapshot memories, in 2nd Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 855, Springer-Verlag, New York, 1994, pp. 171-182.
23. A. ISRAELI, A. SHAHAM, AND A. SHIRAZI, Linear-time snapshot protocols for unbalanced systems, in Proceedings of the 7th International Workshop on Distributed Algorithms, A. Schiper, ed., Lausanne, Switzerland, 1993, Lecture Notes in Comput. Sci. 725, Springer-Verlag, Berlin, 1993, pp. 26-38.
24. L. M. KIROUSIS, P. SPIRAKIS, AND PH. TSIGAS, Reading many variables in one atomic operation: Solutions with linear or sublinear complexity, in Proceedings of the 5th International Workshop on Distributed Algorithms, Delphi, Greece, 1991, Lecture Notes in Comput. Sci. 579, S. Toueg, P. Spirakis, and L. Kirousis, eds., Springer-Verlag, Berlin, 1991, pp. 229-241.