The time complexity of updating snapshot memories

Information Processing Letters

Volumn 65, Issue 1, 1998, Pages 33-40

  Israeli, Amos ^a   Shirazi, Asaf ^b  

^a NETANYA ACADEMIC COLLEGE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed protocol; Fault tolerance; Lower bound; Snapshot memory

Indexed keywords

EID: 0012582526     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00189-0     Document Type: Article

References (22)

1. J. Anderson, Composite registers, Distributed Comput. 3 (3) (1993) 141-154.
2. J. Aspnes, Time- and space-efficient randomized consensus, in: Proc. 9th Ann. ACM Symp. on Principles of Distributed Computing, 1990, pp. 15-29.
3. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, N. Shavit, Atomic snapshots of shared memory, J. ACM 40 (4) (1993) 873-890.
4. J. Aspnes, M. Herlihy, Wait-free data structures in the asynchronous PRAM model, in: Proc. 2nd Ann. Symp. on Parallel Algorithms and Architectures, 1990, pp. 340-349.
5. H. Attiya, M. Herlihy, O. Rachman, Efficient atomic snapshots using lattice agreement, Distributed Comput. (1995) 121-132.
6. H. Attiya, N.A. Lynch, N. Shavit, Are wait-free algorithms fast?, J. ACM 41 (4) (1994) 725-763.
7. H. Attiya, O. Rachman, Atomic snapshots in O(n log n) operations, in: Proc. 12th Ann. ACM Symp. on Principles of Distributed Computing (1993) 29-40.
8. T.D. Chandra, C. Dwork, Personal communication.
9. C. Dwork, M. Herlihy, S. Plotkin, O. Waarts, Time-lapse snapshots, in: Proc. 1st Israeli Symp. on Theory of Computing and Systems, Lecture Notes in Computer Science, vol. 601, Springer, Berlin, 1992, pp. 154-170.
10. D. Dolev, N. Shavit, Bounded concurrent time-stamp systems are constructible!, in: Proc. 21st Ann. ACM Symp. on Theory of Computing, 1989, pp. 454-465.
11. M.P. Herlihy, Impossibility and universality results for wait-free synchronization, ACM Trans. Programming Languages and Systems, 1988, pp. 124-149.
12. M.P. Herlihy, J.M. Wing, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Languages and Systems 12 (3) (1990) 463-492.
13. J.H. Hoepman, J. Tromp, Binary snapshots, in: Proc. 7th Internat. Workshop on Distributed Algorithms and Graphs, Lecture Notes in Computer Science, vol. 725, Springer, Berlin, 1993, pp. 18-25.
14. M. Inoue, W. Chen, T. Masuzawa, N. Tokura, Linear-time snapshot using multi-writer multi-reader registers, in: Proc. 8th Internat. Workshop on Distributed Algorithms and Graphs, 1994.
15. A. Israeli, M. Li, P. Vitanyi, Simple multireader registers using time-stamp schemes, Rept. No. CS-R8758, Center for Mathematics and Computer Science, Amsterdam, The Netherlands, 1987.
16. A. Israeli, A. Shaham, Optimal multi-writer multi-reader atomic registers, in: Proc. 11th Ann. ACM Symp. on Principles of Distributed Computing, 1992, pp. 71-82.
17. A. Israeli, A. Shirazi, Efficient snapshot protocol using 2-lattice agreement, Preprint.
18. A. Israeli, A. Shaham, A. Shirazi, Linear-time snapshot protocols for unbalanced systems, in: Proc. 7th Internat. Workshop on Distributed Algorithms and Graphs, Lecture Notes in Computer Science, vol. 725, Springer, Berlin, 1993, pp. 18-25.
19. L.M. Kirousis, P. Spirakis, P. Tsigas, Reading many variables in one atomic operation: Solutions with linear or sublinear complexity, in: Proc. 5th Internat. Workshop on Distributed Algorithms and Graphs, Lecture Notes in Computer Science, vol. 579, Springer, Berlin, 1991, pp. 229-241.
20. L. Lamport, On interprocess communication. Part I: Basic formalism. Distributed Comput. 1 (2) (1986) 77-85.
21. L. Lamport, On interprocess communication. Part II: Algorithms, Distributed Comput. 1 (2) (1986) 86-101.
22. P. Vitanyi, B. Awerbuch, Atomic shared register access by asynchronous hardware, in: Proc. 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 233-243.