Adaptive and efficient algorithms for lattice agreement and renaming

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 642-664

  Attiya, Hagit ^a   Fouren, Arie ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Atomic read write registers; Atomic snapshots; Lattice agreement; Renaming; Shared memory systems; Wait free computation

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL PROGRAMMING; SET THEORY;

SHARED MEMORY SYSTEMS;

ADAPTIVE ALGORITHMS;

EID: 0036248044     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700366000     Document Type: Article

References (28)

1. Y. AFEK, H. ATTIYA, D. DOLEV, E. GAFNI, M. MERRITT, AND N. SHAVIT, Atomic snapshots of shared memory, J. Assoc. Comput. Mach., 40 (1993), pp. 873-890.
2. Y. AFEK, H. ATTIYA, A. FOUREN, G. STUPP, AND D. TOUITOU, Long-lived renaming made adaptive, in Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, ACM, Atlanta, 1999, pp. 91-103.
3. Y. AFEK, D. DAUBER, AND D. TOUITOU, Wait-free made fast, in Proceedings of the 27th ACM Symposium on Theory of Computing, ACM, Las Vegas, 1995, pp. 538-547.
4. Y. AFEK AND M. MERRITT, Fast, wait-free (2k - 1)-renaming, in Proceedings of the 18th ACM Symposium on Principles of Distributed Computing, ACM, Atlanta, 1999, pp. 105-112.
5. Y. AFEK, G. STUPP, AND D. TOUITOU, Long-Lived Adaptive Splitter and Applications, manuscript, 1999.
6. Y. AFEK, G. STUPP, AND D. TOUITOU, Long-lived and adaptive collect with applications, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, New York, 1999, pp. 262-272.
7. Y. AFEK, G. STUPP, AND D. TOUITOU, Long-lived and adaptive atomic snapshot and immediate snapshot, in Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, Portland, OR, 2000, pp. 71-80.
8. R. ALUR AND G. TAUBENFELD, Results about fast mutual exclusion, in Proceedings of the Real-Time Systems Symposium, IEEE, Phoenix, 1992, pp. 12-22.
9. J. H. ANDERSON AND M. MOIR, Using local-spin k-exclusion algorithms to improve wait-free object implementation, Dist. Comp., 11 (1997), pp. 1-20.
10. H. ATTIYA, A. BAR-NOY, D. DOLEV, D. PELEG, AND R. REISCHUK, Renaming in an asynchronous environment, J. Assoc. Comput. Mach., 37 (1990), pp. 524-548.
11. H. ATTIYA AND V. BORTNIKOV, Adaptive and efficient mutual exclusion, in Proceedings of the 19th ACM Symposium on Principles of Distributed Computing, Portland, OR, 2000, pp. 91-100.
12. H. ATTIYA AND A. FOUREN, Adaptive wait-free algorithms for lattice agreement and renaming, in Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, Puerto Vallarta, Mexico, 1998, pp. 277-286.
13. H. ATTIYA AND A. FOUREN, An adaptive collect algorithm with applications, submitted. Available at www.es.technion.ac.il/∼hagit/pubs/AF99ful.ps.gz, Aug. 1999.
14. H. ATTIYA AND A. FOUREN, Polynomial and adaptive long-lived (2k - 1)-renaming, in Proceedings of the 14th International Conference on Distributed Computing, Toledo, Spain, Lecture Notes in Comput. Sci. 1914, Springer-Verlag, Berlin, 2000, pp. 149-163.
15. H. ATTIYA, M. HERLIHY, AND O. RACHMAN, Atomic snapshots using lattice agreement, Dist. Comp., 8 (1995), pp. 121-132.
16. H. ATTIYA AND O. RACHMAN, Atomic snapshots in O(n log n) operations, SIAM J. Comput., 27 (1998), pp. 319-340.
17. A. BAR-NOY AND D. DOLEV, A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment, Math. Sys. Theory, 26 (1993), pp. 21-39.
18. E. BOROWSKY AND E. GAFNI, Immediate atomic snapshots and fast renaming, in Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, Ithaca, NY, 1993, pp. 41-52.
19. J. E. BURNS AND G. L. PETERSON, The ambiguity of choosing, in Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, Edmonton, AB, Canada, 1989, pp. 145-158.
20. M. CHOY AND A. K. SINGH, Adaptive solutions to the mutual exclusion problem, Dist. Comp., 8 (1994), pp. 1-17.
21. A. FOUREN, Exponential Examples for Two Renaming Algorithms, http://www.cs.technion. ac.il/∼hagit/pubs/expo.ps.gz (August 1999).
22. M. HERLIHY AND N. SHAVIT, The topological structure of asynchronous computability, J. Assoc. Comput. Mach., 46 (1999), pp. 858-923.
23. 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, Springer-Verlag, Berlin, 1994, pp. 130-140.
24. L. LAMPORT, A new solution of Dijkstra's concurrent programming problem, Comm. ACM, 18 (1974), pp. 453-455.
25. L. LAMPORT, A fast mutual exclusion algorithm, ACM Trans. Comput. Syst., 5 (1987), pp. 1-11.
26. M. MOIR, Fast, long-lived renaming improved and simplified, Sci. Comput. Programming, 30 (1998), pp. 287-308.
27. M. MOIR AND J. H. ANDERSON, Wait-free algorithms for fast, long-lived renaming, Sci. Comput. Programming, 25 (1995), pp. 1-39.
28. M. MOIR AND J. A. GARAY, Fast long-lived renaming improved and simplified, in Proceedings of the 10th International Workshop on Distributed Algorithms, Bologna, Italy, Lecture Notes in Comput. Sci. 1511, Springer-Verlag, Berlin, 1996, pp. 287-303.