Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

New token passing distributed mutual exclusion algorithm

Banerjee, S and Chrysanthis, PK (1996) New token passing distributed mutual exclusion algorithm. UNSPECIFIED. UNSPECIFIED.

[img] Plain Text (licence)
Available under License : See the attached license file.

Download (1kB)


Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is proposed. The algorithm incurs approximately three messages at high loads, irrespective of the number of nodes N in the system. At low loads, it requires approximately N messages. The paper also addresses failure recovery issues, such as token loss.


Social Networking:
Share |


Item Type: Monograph (UNSPECIFIED)
Status: Published
CreatorsEmailPitt UsernameORCID
Banerjee, S
Chrysanthis, PKpanos@pitt.eduPANOS0000-0001-7189-9816
Date: 1 January 1996
Date Type: Publication
Access Restriction: No restriction; Release the ETD for access worldwide immediately.
Page Range: 717 - 724
Institution: University of Pittsburgh
Department: School of Library and Information Science
Schools and Programs: School of Information Sciences > Library and Information Science
Refereed: No
University of Pittsburgh Series: iSchool Research Report Series
Other ID: LIS059/IS95003
Date Deposited: 10 Apr 2013 20:32
Last Modified: 08 Feb 2020 16:55


Monthly Views for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item