DocumentCode
3266600
Title
Divide and conquer for distributed mutual exclusion
Author
Ramarao, K.V.S. ; Brahmadathan, K.
Author_Institution
SBC Technol. Resources Inc., St. Louis, MO, USA
fYear
1990
fDate
9-13 Dec 1990
Firstpage
113
Lastpage
120
Abstract
A simple formal model of distributed mutual exclusion algorithms is introduced and a new class of algorithms is derived using the divide and conquer paradigm. A number of metrics reflecting certain realistic concerns about the distributed mutual exclusion algorithms are proposed and several relationships among them are identified. It is shown that the divide and conquer paradigm significantly simplifies the derivation of algorithms with desired values for these metrics. The new class of algorithms is compared to the voting algorithms
Keywords
distributed processing; parallel algorithms; distributed mutual exclusion algorithms; divide and conquer; formal model; metrics; voting algorithms; Algorithm design and analysis; Computational modeling; Computer science; Concurrent computing; Distributed computing; Message passing; Parallel processing; Partitioning algorithms; Topology; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2087-0
Type
conf
DOI
10.1109/SPDP.1990.143517
Filename
143517
Link To Document