A time complexity bound for adaptive mutual exclusion (Extended abstract)

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

Volumn 2180, Issue , 2001, Pages 1-15

  Kim, Yong Jik ^a   Anderson, James H ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRITICAL SECTIONS; DETERMINISTIC ALGORITHMS; EXTENDED ABSTRACTS; LOWER BOUNDS; MUTUAL EXCLUSION ALGORITHMS; MUTUAL EXCLUSIONS; REMOTE MEMORY REFERENCES; TIME COMPLEXITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84956972600     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_1     Document Type: Conference Paper

References (14)

1. Y. Afek, H. Attiya, A. Fouren, G. Stupp, and D. Touitou. Long-lived renaming made adaptive. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 91–103. May 1999.
2. Y. Afek, P. Boxer, and D. Touitou. Bounds on the shared memory requirements for long-lived and adaptive objects. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 81–89. July 2000.
3. J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. In Proceedings of the 14th International Symposium on Distributed Computing, pages 29–43, October 2000.
4. J. Anderson and Y.-J. Kim. An improved lower bound for the time complexity of mutual exclusion. To be presented at the 20th Annual ACM Symposium on Principles of Distributed Computing, August 2001.
5. J. Anderson and J.-H. Yang. Time/contention tradeoffs for multiprocessor synchronization. Information and Computation, 124(1):68–84, January 1996.
6. H. Attiya and V. Bortnikov. Adaptive and efficient mutual exclusion. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 91–100. July 2000.
7. J. Burns and N. Lynch. Mutual exclusion using indivisible reads and writes. In Proceedings of the 18th Annual Allerton Conference on Communication,Control, and Computing, pages 833–842, 1980.
8. M. Choy and A. Singh. Adaptive solutions to the mutual exclusion problem. Distributed Computing, 8(1):1–17, 1994.
9. L. Lamport. A fast mutual exclusion algorithm. ACM Transactions on Computer Systems, 5(1):1–11, February 1987.
10. M. Merritt and G. Taubenfeld. Speeding Lamport’s fast mutual exclusion algorithm. Information Processing Letters, 45:137–142, 1993.
11. E. Styer. Improving fast mutual exclusion. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 159–168. August 1992.
12. E. Styer and G. Peterson. Tight bounds for shared memory symmetric mutual exclusion. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 177–191. August 1989.
13. P. Turán. On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok, 48:436–452, 1941.
14. J.-H. Yang and J. Anderson. A fast, scalable mutual exclusion algorithm. Distributed Computing, 9(1):51–60, August 1995.