Time-lapse snapshots

SIAM Journal on Computing

Volumn 28, Issue 5, 1999, Pages 1848-1874

  Dwork, Cynthia ^a   Herlihy, Maurice ^b   Plotkin, Serge ^c   Waarts, Orli ^d  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b Brown Univerity   (United States)

^c Stanford University   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; RANDOM ACCESS STORAGE; RANDOM PROCESSES;

ATOMIC SNAPSHOTS; PROGRAMMABLE RANDOM ACCESS MEMORY; SHARED MEMORY ALGORITHM; TIME LAPSE SNAPSHOTS; TIMESTAMPING PROTOCOL;

MULTIPROCESSING SYSTEMS;

EID: 0032620754     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793243685     Document Type: Article

References (44)

1. K. ABRAHAMSON, On achieving consensus using a shared memory, in Proc. 7th ACM Symposium on Principles of Distributed Computing, Toronto, Ontario, ACM, New York, 1988, pp. 291-302.
2. Y. APEK, H. ATTIYA, D. DOLEV, E. GAFNI, M. MERRITT, AND N. SHAVIT, Atomic snapshots of shared memory, J. ACM, 40 (1993), pp. 872-890.
3. J. ANDERSON, Composite registers, Distrib. Comput., 6 (1987), pp. 141-154.
4. J. ANDERSON AND B. GROSELJ, Beyond atomic registers: Bounded wait-free implementations of non-trivial objects, Sci. Comput. Programming. 19 (1992), pp. 197-237.
5. J. ASPNES, Time- and space-efficient randomized consensus, J. Algorithms, 14 (1993), pp. 414-431.
6. J. ASPNES AND M. P. HERLIHY, Wait-free data structures in the asynchronous PRAM model, in Proc. 2nd Annual Symposium on Parallel Algorithms and Architectures, Crete, Greece, 1990, pp. 340-349.
7. J. ASPNES AND M. P. HERLIHY, Fast randomized consensus using shared memory, J. Algorithms, 11 (1990), pp. 441-461.
8. 2 N) operations, SIAM J. Comput., 25 (1996), pp. 1024-1044.
9. H. ATTIYA, D. DOLEV, AND N. SHAVIT, Bounded polynomial randomized consensus, in Proc. 8th ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, ACM, New York, 1989, pp. 281-294.
10. H. ATTIYA, M. HERLIHY, AND O. RACHMAN, Efficient atomic snapshots using lattice agreement, in Proc. 6th International Workshop on Distributed Algorithms, Lecture Notes in Comput. Sci. 647, Springer-Verlag, New York, 1992, pp. 35-53.
11. H. ATTIYA AND O. RACHMAN, Atomic snapshots in O(n log n) operations, in Proc. 12th ACM Symposium on Principles of Distributed Computing, Ithaca, NY, ACM, New York, 1993, pp. 29-39.
12. 2 log n) operations, in Proc. 5th International Workshop on Distributed Algorithms, Delphi, Greece, 1991, Lecture Notes in Comput. Sci. 579, Springer-Verlag, Berlin, 1992, pp. 143-150.
13. G. BRACHA AND O. RACHMAN, Approximated Counters and Randomized Consensus, Technical report 662, Computer Science Department, Israel Institute of Technology, Haifa, Israel, 1990.
14. T. D. CHANDRA AND C. DWORK, Using Consensus to Solve Atomic Snapshots, manuscript, August 1992.
15. K. M. CHANDY AND L. LAMPORT, Distributed snapshots: Determining global states of distributed systems, ACM Trans. Comput. Systems, 3 (1985), pp. 63-75.
16. B. CHOR AND C. DWORK, Randomization in Byzantine agreement, Adv. Comput. Res., 4 (1989), pp. 443-497.
17. B. CHOR, A. ISRAELI, AND M. LI, Wait-free consensus using asynchronous hardware, SIAM J. Comput., 23 (1994), pp. 701-712.
18. D. DOLEV, C. DWORK, AND L. STOCKMEYER, On the minimal synchronism needed for distributed consensus, J. ACM, 34 (1987), pp. 77-97.
19. D. DOLEV AND N. SHAVIT, Bounded concurrent time-stamp systems are constructible!, SIAM J. Comput.26 (1997), pp. 418-455
20. C. DWORK AND O. WAARTS, Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!, in Proc. 24th ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 655-666.
21. R. GAWLICK, Concurrent Timestamping Made Simple, M.Sc. thesis, MIT, Cambridge, MA, 1992.
22. R. GAWLICK, N. LYNCH, AND N. SHAVIT, Concurrent timestamping made simple, in Proc. Israel Symposium on Theory of Computing and Systems, Haifa, Israel, Lecture Notes in Comput. Sci. 601, Springer-Verlag, Berlin, 1992, pp. 171-183.
23. S. HALDAR, Efficient Bounded Timestamping Using Traceable Use Abstraction - Is Writer's Guessing Better than Reader's Telling?, Technical report RUU-CS-93-28, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, 1993.
24. M. P. HERLIHY, Wait-free synchronization, ACM Trans. Programming Languages and Systems, 13 (1991), pp. 124-149.
25. M. P. HERLIHY AND J. M. WING, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Languages and Systems. 12 (1990), pp. 463-492.
26. A. ISRAELI AND M. LI, Bounded time stamps, Distrib. Comput., 6 (1993), pp. 205-209.
27. A. ISRAELI, M. LI, AND P. M. B. VITÁNYI, Simple Multireader Registers using Timestamp Systems, Technical report CS-R8758, CWI, Amstedam, 1987.
28. A. ISRAELI AND M. PINHASOV, A concurrent time-stamp scheme which is linear in time and space, in Proc. 6th International Workshop on Distributed Algorithms, Lecture Notes in Comput. Sci. 647, Springer-Verlag. Berlin, New York, 1992, pp. 95-109.
29. L. KIROUSIS, E. KRANAKIS, AND P. M. B. VITÁNYI, Atomic multireader register, in Proc. 2nd International Workshop on Distributed Algorithms, Berlin, 1987, Lecture Notes in Comput. Sci. 312, Springer-Verlag, Berlin, New York, pp. 278-296.
30. L. M. KIROUSIS, P. SPIRAKIS, AND P. TSIGAS, Reading many variables in one atomic operation: Solutions with linear or sublinear complexity, IEEE Trans. on Parallel and Distributed Systems, 5 (1994), pp. 688-696.
31. L. LAMPORT, Concurrent reading and writing, Commun. ACM, 20 (1977), pp. 806-811.
32. L. LAMPORT, On Interprocess communication, part II: Algorithms, Distrib. Comput., 1 (1986), pp. 86-101.
33. M. LI, J. TROMP, AND P. M. B. VITÁNYI, How to Share Concurrent Wait-free Variables, JACM, 43 (1996), pp. 723-746.
34. M. LI AND P. M. B. VITÁNYI, A Very Simple Construction for Atomic Multiwriter Register, Technical report TR-8701, Aiken Computation Laboratory, Harvard University, Cambridge, MA, 1987.
35. M. LI AND P. M. B. VITÁNYI, How to share concurrent asynchronous wait-free variables, in Proc. ICALP (1989), Lecture Notes in Comput. Sci. 372, Springer-Verlag, Berlin, New York, 1989, pp. 488-505.
36. M. C. LOUI AND H. H. ABU-AMARA, Memory requirements for agreement among unreliable, asynchronous processes. Adv. Comput. Res., 4 (1987), pp. 163-183.
37. R. NEWMAN-WOLFE, A protocol for wait-free atomic multi-reader shared variables, in Proc. 6th ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, ACM, New York, 1987, pp. 232-248.
38. G. PETERSON, Concurrent reading while writing, ACM Trans Programming Languages and Systems, 5 (1983), pp. 46-55.
39. M. RABIN, Randomized Byzantine generals, in Proc. 24th IEEE Symposium on Foundations of Computer Science, Tuscon, AZ, IEEE Press, Piscataway, NJ, 1983, pp. 403-409.
40. M. SAKS, N. SHAVIT, AND H. WOLL, Optimal time randomized consensus - making resilient algorithms fast in practice, in Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM, New York, 1991, pp. 351-362.
41. A. SINGH, Towards an understanding of unbounded variables in asynchronous systems, Inform. Process. Lett., 42 (1992), pp. 7-17.
42. A. SINGH, J. ANDERSON, AND M. GAUDA, The elusive atomic register revisited, in Proc. 6th ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, ACM, New York, 1987, pp. 206-221.
43. J. TROMP, How to construct an atomic variable, in Proc. 3rd International Workshop on Distributed Algorithms, Lecture Notes in Comput. Sci. 392, Springer-Verlag, New York, 1989, pp. 292-302.
44. P. M. B. VITÁNYI AND B. AWERBUCH, Atomic shared register access by asynchronous hardware, in Proc. 27th IEEE Symposium on Foundations of Computer Science, Toronto, Ontario, IEEE Press, Piscataway, NJ, 1986, pp. 233-243.