Algorithms adapting to point contention

Journal of the ACM

Volumn 50, Issue 4, 2003, Pages 444-468

  Attiya, Hagit ^a   Fouren, Arie ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Israeli Center for Academic Studies   (Israel)

Author keywords

Asynchronous shared memory systems; Collect; Contention sensitive complexity; Read write registers; Renaming; Wait free algorithms

Indexed keywords

COMPUTER APPLICATIONS; DATA STORAGE EQUIPMENT; PROCESS CONTROL;

ASYNCHRONOUS SHARED-MEMORY SYSTEMS; COLLECT; CONTENTION-SENSITIVE COMPLEXITY; READ/WRITE REGISTERS; RENAMING; WAIT-FREE ALGORITHMS;

ALGORITHMS;

EID: 10444290235     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/792538.792541     Document Type: Article

References (25)

1. AFEK, Y., ATTIYA, H., DOLEV, D., GAFNI, E., MERRITT, M., AND SHAVIT, N. 1993. Atomic snapshots of shared memory. J. ACM 40, 4 (Sept.). 873-890.
2. AFEK, Y., ATTIYA, H., FOUREN, A., STUPP, G., AND TOUITOU, D. 1999a. Long-lived renaming made adaptive. In Proceedings of the 18th ACM Symposium on the Principles of Distributed Computing. ACM, New York, 91-103.
3. AFEK, Y., ATTIYA, H., FOUREN, A., STUPP, G., AND TOUITOU, D. 1999b. Adaptive long-lived renaming using bounded memory. www.cs.technion.ac.il/~hagit/ pubs/AAFST99disc.ps.gz.
4. AFEK, Y., DAUBER, D., AND TOUITOU, D. 1995. Wait-free made fast. In Proceedings of the 27th ACM Symposium on Theory of Computing. ACM Press, New York, 538-547.
5. AFEK, Y., AND MERRITT, M. 1999. Fast, wait-free (2k - 1)-renaming. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing. ACM, New York, 105-112.
6. AFEK, Y., STUPP, G., AND TOUITOU, D. 1999c. Long-lived and adaptive collect with applications. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 262-272.
7. AFEK, Y., STUPP, G., AND TOUITOU, D. 2000. Long-lived and adaptive atomic snapshot and immediate snapshot. In Proceedings of the 19th ACM Symposium on the Principles of distributed computing. ACM, New York, 71-80.
8. AFEK, Y., STUPP, G., AND TOUITOU, D. 2002. Long-lived adaptive splitter and applications. Dist. Cornput. 15, 2, 67-86.
9. AFEK, Y., AND WEISBEROER, E. 1999. The instancy of snapshots and commuting objects. J. Alg. 30, 1 (Jan.), 68-105.
10. ANDERSON, J. 1994. Multi-writer composite registers. Dist. Comput. 7, 4 (May), 175-196.
11. ASPNES, J., AND WAARTS, O. 1996. Modular competitiveness for distributed algorithms. In Proceedings of the 28th ACM Symposium on the Theory of Computing. ACM, New York, 237-246.
12. ATTIYA, H., BAR-NOY, A., DOLEV, D., PELEG, D., AND REISCHUK, R. 1990. Renaming in an asynchronous environment. J. ACM 37, 3 (July), 524-548.
13. ATTIYA, H., AND BORTNIKOV, V. 2002. Adaptive and efficient mutual exclusion. Dist. Comput. 15, 3, 177-189.
14. ATTIYA, H., AND FOUREN, A. 2000. Polynomial and adaptive long-lived (2k- 1)-renaming. In Proceedings of the 14th International. Symposium on Distributed Computing. Springer-Verlag, Berlin, Germany, 149-163.
15. ATTIYA, H., AND FOUREN, A. 2001. Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput. 31, 2, 642-664.
16. ATTIYA, H., FOUREN, A., AND GAFNI. E. 2002. An adaptive collect algorithm with applications. Dist. Comput. 15, 2, 87-96.
17. ATTIYA, H., AND ZACH, I. 2002. Fully adaptive algorithms for atomic and immediate snapshots, submitted for publication.
18. BOROWSKY, E., AND GAFNI, E. 1993. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings of the 25th ACM Symposium Theory of Computing. ACM, New York, 91-100.
19. BOROWSKY, E., GAFNI, E., LYNCH, N., AND RAJSBAUM, S. 2001. The BG distributed simulation algorithm. Dist. Comput. 14, 3, 127-146.
20. CHOY, M., AND SINGH, A. K. 1994. Adaptive solutions to the mutual exclusion problem. Dist. Comput. 8, 1, 1-17.
21. FOUREN, A. 1998. Wait-free algorithms with contention-dependent complexity. M.S. dissertation, Department of Computer Science, The Technion, Haifa, Israel.
22. HERLIHY, M. 1991. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1 (Jan.), 124-149.
23. 2) steps. In Proceedings of the 15th International Symposium on Distributed Computing. Springer-Verlag, Berlin, Germany, 123-135.
24. MOIR, M., AND ANDERSON, J. H. 1995. Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25, 1 (Oct.), 1-39.
25. STUPP, G. 2001. Long lived and adaptive shared memory implementations. Ph.D. dissertation, Department of Computer Science, Tel Aviv, University, Tel Aviv, Israel.