An O(n1/3) algorithm for distributed mutual exclusion

dc.citation.epage420en_US
dc.citation.issueNumber5en_US
dc.citation.spage409en_US
dc.citation.volumeNumber45en_US
dc.contributor.authorChaudhuri, P.en_US
dc.contributor.authorKaraata, M. H.en_US
dc.date.accessioned2016-02-08T10:42:33Z
dc.date.available2016-02-08T10:42:33Z
dc.date.issued1998en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractIn 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.en_US
dc.identifier.doi10.1016/S1383-7621(97)00087-8en_US
dc.identifier.issn1383-7621
dc.identifier.urihttp://hdl.handle.net/11693/25305
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://doi.org/10.1016/S1383-7621(97)00087-8en_US
dc.source.titleJournal of Systems Architectureen_US
dc.subjectComputer networken_US
dc.subjectCritical sectionsen_US
dc.subjectDistributed algorithmen_US
dc.subjectMessage complexityen_US
dc.subjectMutual exclusionen_US
dc.subjectAlgorithmsen_US
dc.subjectComputational complexityen_US
dc.subjectDistributed computer systemsen_US
dc.titleAn O(n1/3) algorithm for distributed mutual exclusionen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
An O(n1 3) algorithm for distributed mutual exclusion.pdf
Size:
188.81 KB
Format:
Adobe Portable Document Format
Description:
Full printable version