An O(n1/3) algorithm for distributed mutual exclusion
Date
1998
Authors
Chaudhuri, P.
Karaata, M. H.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Journal of Systems Architecture
Print ISSN
1383-7621
Electronic ISSN
Publisher
Elsevier
Volume
45
Issue
5
Pages
409 - 420
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Series
Abstract
In this paper, a distributed algorithm is proposed that realizes mutual exclusion among n nodes in a computer network. No common or global memory is shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The best-known algorithms so far, for the distributed mutual exclusion problem, require O(√n) messages per mutual exclusion invocation. The proposed algorithm is the first to cross this O(√n) barrier and the message complexity achieved by our algorithm is O(n1/3) per mutual exclusion. © 1998 Elsevier Science B.V. All rights reserved.