A simple group mutual l-exclusion algorithm

Information Processing Letters

Volumn 85, Issue 2, 2003, Pages 79-85

  Vidyasankar, K ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Algorithms; Concurrency; Distributed computing; Forums; Group mutual exclusion; Group mutual l exclusion; l exclusion; Multiple forum requests; Mutual exclusion

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

MUTUAL EXCLUSION ALGORITHMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037473755     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00355-1     Document Type: Article

References (7)

1. Alagarsamy K., Vidyasankar K. Fair and efficient mutual exclusion algorithms. Proceedings of the 13th International Symposium on DIStributed Computing (DISC'99). Lecture Notes in Comput. Sci. 1693:1999;166-179 Springer, Berlin.
2. K. Alagarsamy, K. Vidyasankar, Elegant solutions to group mutual exclusion problem, Unpublished manuscript, 1999.
3. Fischer M., Lynch N., Burns J., Borodin A. Resource allocation with immunity to process failure. Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science. 1979;78-92.
4. Hadzilacos V. A note on group mutual exclusion. Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing. 2001;100-106.
5. Joung Y.-J. Asynchronous group mutual exclusion. Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing. 1998;51-60.
6. Keane P., Moir M. A simple local-spin group mutual exclusion algorithm. Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing. 1999;23-32.
7. Peterson G.L. Myths about the mutual exclusion problem. Inform. Process. Lett. 12:(3):1981;115-116.