Asynchronous group mutual exclusion in ring networks

IEE Proceedings: Computers and Digital Techniques

Volumn 147, Issue 1, 2000, Pages 1-8

  Wu, K P ^a   Joung, Y J ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONCURRENCY CONTROL; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

ASYNCHRONOUS GROUP MUTUAL EXCLUSION; RING NETWORKS; SHARED MEMORY MODELS;

COMPUTER NETWORKS;

EID: 0033893113     PISSN: 13502387     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-cdt:20000162     Document Type: Article

References (6)

1. JOUNG, Y.-J.'Asynchronous group mutual exclusion (extended abstract)', Proceedings of 17th ACM Symposium on Principles of Distributed Computing (PODC), pp. 51-60, June 1998
2. JOUNG, Y.-J.The congenial talking philosophers problem in computer networks', Technical report, Dcpt. of Info. Management, National Taiwan University, Taipei, Taiwan, 1998. Extended abstract appeared in Proceed-ings 13th International Symposium on Distributed Computing (DISC99)
3. LAMPORT, L.'Time, clocks and the ordering of events in a distributed system', Commun. ACM, 1978, 21, (7), pp. 558-565
4. Java applets, animating the algorithms in the paper: http://joung.im. ntu.edu.tw/congenial/
5. HOARE, C.A.R.'Communicating sequential processes', Commun ACM, 1978, 21, (8), pp. 666-677
6. RICART, G.and AGRAWALA, A.K.'An optimal algorithm for mutual exclusion in computer networks, 1981, 24, (1), pp. 9-17