Polynomial and adaptive long-lived (2k – 1)-renaming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1914, Issue , 2000, Pages 149-163

  Attiya, Hagit ^a   Fouren, Arie ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

ACTIVE PROCESS; ADAPTIVENESS; NOVEL APPLICATIONS; POLYNOMIAL ALGORITHM; RENAMING PROBLEM; STEP COMPLEXITY;

POLYNOMIALS;

EID: 84958749823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_10     Document Type: Conference Paper

References (22)

1. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Adaptive long-lived renaming using bounded memory. Available at www.cs.technion.ac.il/~hagit/pubs/AAFST99disc.ps.gz, Apr. 1999.
2. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proc. 18th ACM Syrup. Principles of Dist. Comp., pages 91-103, 1999.
3. Y. Afek and M. Merritt. Fast, wait-free (2k — l)-renaming. In Proc. 18th ACM Symp. Principles of Dist. Comp., pages 105-112, 1999.
4. Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive collect with appli¬cations. In Proc. 40th, IEEE Symp. Foundations of Comp. Sci., pages 262-272, 1999.
5. Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive atomic snapshot and immediate snapshot. In Proc. 19th ACM Syrup. Principles of Dist. Comp., 2000. To appear.
6. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, andR. Reischuk. Renaming in an asyn¬chronous environment. J. ACM, 37(3):524-548, July 1990.
7. H. Attiya and A. Fouren. Adaptive wait-free algorithms for lattice agreement and renaming. In Proc. 17th ACM Symp. Principles of Dist. Comp., pages 277-286, 1998.
8. H. Attiya and A. Fouren. An adaptive collect algorithm with applications. Submitted for publication. Avail¬able at www.cs.technion.ac.il/~hagit/pubs/AF99ful.ps.gz, Aug. 1999.
9. H. Attiya and A. Fouren. Adaptive long-lived renaming with read and write oper¬ations. Technical Report 956, Faculty of Computer Science, The Technion, Mar. 1999. Available at www.cs.technion.ac.il/~hagit/pubs/tr0956.ps.gz.
10. 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(l):21-39, 1993.
11. E. Borowsky and E. Gafni. Generalized FLP impossibility result for f-resilient asynchronous computations. In Proc. 25th ACM Symp. Theory of Comp., pages 91-100, 1993.
12. E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In Proc. 12th ACM Symp. Principles of Dist. Comp., pages 41-52, 1993.
13. E. Borowsky, E. Gafni, N. Lynch, and S. Rajsbaum. The BG distributed simula¬tion algorithm. Technical Report MIT/LCS/TM-573, Laboratory for Computer Science, MIT, Dec. 1997.
14. H. Buhrman, J. A. Garay, J.-H. Hoepman, and M. Moir. Long-lived renaming made fast. In Proc. 14th ACM Symp. Principles of Dist. Comp., pages 194-203, 1995.
15. J. E. Burns and G. L. Peterson. The ambiguity of choosing. In Proc. 8th ACM Symp. Principles of Dist. Comp., pages 145-158, 1989.
16. A. Fouren. Exponential examples for two renaming algorithms. Available at www.cs.technion.ac.il/~hagit/pubs/expo.ps.gz, Aug. 1999.
17. E. Gafni. More about renaming: Fast algorithm and reduction to the k-set test- and-set problem. Unpublished manuscript, 1992.
18. M. Herlihy and N. Shavit. A simple constructive computability theorem for wait- free computation. In Proc. 26th ACM Symp. Theory of Comp., pages 243-252, 1994.
19. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. Com,put. Syst, 5(1): 1—11, Feb. 1987.
20. M. Moir. Fast, long-lived renaming improved and simplified. Sci. Comput. Pro¬gramming, 30(3):287-308, May 1998.
21. M. Moir and J. H. Anderson. Wait-free algorithms for fast, long-lived renaming. Sci. Com,put. Programming, 25(1):1—39, Oct. 1995.
22. M. Moir and J. A. Garay. Fast long-lived renaming improved and simplified. In Proc. 10th, Int. Workshop on Dist. Algorithms, volume 1151 of Lecture Notes in Computer Science, pages 287-303. Springer-Verlag, 1996