An optimal multi-writer snapshot algorithm

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 723-732

  Jayanti, Prasad ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

Asynchronous; Concurrent algorithm; Fault tolerant; Lock free; Snapshot; Wait free

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; FAULT TOLERANT COMPUTER SYSTEMS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS; CONCURRENT ALGORITHM; FAULT-TOLERANT; LOCK-FREE; SNAPSHOT; WAIT-FREE;

ALGORITHMS;

EID: 33745289424     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060697     Document Type: Conference Paper

References (18)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. In Proceedings of the 9th Annual Symposium on Principles of Distributed Computing, pages 1-14, 1990.
2. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. Journal of the ACM, 40(4):873-890, September 1993.
3. J. Anderson. Composite registers. In Proceedings of the 9th Annual Symposium on Principles of Distributed Computing, pages 15-29, 1990.
4. J. Anderson. Composite registers. Distributed Computing, 6(3):141-154, 1993.
5. J. Anderson. Multi-writer composite registers. Distributed Computing, 7(4):175-195, 1994.
6. J. Aspnes and M. Herlihy. Wait-free data structures in the asynchronous PRAM model. In Proceedings of the 2nd Annual ACM Symposium on Parallel Architectures and Algorithms, pages 340-349, 1990.
7. H. Attiya, M. Herlihy, and O. Rachman. Efficient atomic snapshots using lattice agreement. In Proceedings of the 6th International Workshop on Distributed Algorithms, pages 35-53, 1992.
8. H. Attiya and O. Rachman. Atomic snapshots in o(n log n) operations. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 29-40, 1993.
9. T. D. Chandra and C. Dwork. Using consensus to solve atomic snapshots. Unpublished manuscript, 1993.
10. C. Dwork, M. P. Herlihy, S. Plotkin, and O. Waarts. Time lapse snapshots. In Proceedings of the Israel Symposium on the Theory of Computing and Systems, pages 154-170, May 1992.
11. S. Haldar and K. Vidyasankar. Elegant constructions of atomic snapshot variables. Technical Report Technical Report No: 9204, Memorial University of Newfoundland, Department of Computer Science, Memorial University of Newfoundland, St. John's, NF, Canada, A1C 5S7, May 1992.
12. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM TOPLAS, 12(3):463-492, 1990.
13. P. Jayanti. f-arrays: implementation and applications. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, pages 270 - 279, 2002.
14. P. Jayanti and S. Petrovic. Efficient and practical constructions of LL/SC variables. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, July 2003.
15. P. Jayanti and S. Petrovic. Efficient wait-free implementation of multiword 11/sc variables. In Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS), June 2005.
16. L. Kirousis, P. Spirakis, and P. Tsigas. Reading many variables in one atomic operation: solutions with linear or sublinear complexity. In Proceedings of the 5th International Workshop on Distributed Algorithms, pages 229-241, 1991.
17. M. Moir. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 219-228, August 1997.
18. Y. Riany, N. Shavit, and D. Touitou. Towards a practical snapshot algorithm. Theoretical Computer Science, 269(1-2):163-201, 2001.