DocumentCode
2674190
Title
Two new quorum based algorithms for distributed mutual exclusion
Author
Luk, Wai-Shing ; Wong, Tien-Tsin
Author_Institution
Dept. Computerwetenschappen, Katholieke Univ., Leuven, Belgium
fYear
1997
fDate
27-30 May 1997
Firstpage
100
Lastpage
106
Abstract
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modification of Maekawa´s (1985) grid based quorum scheme. The size of quorums is approximately √2√N where N is the number of sites in a network, as compared to 2√N of the original method. The method is simple and geometrically evident. The second one is based on the idea of difference sets in combinatorial theory. The resulting scheme is very close to optimal in terms of quorum size
Keywords
combinatorial mathematics; communication complexity; concurrency control; distributed algorithms; optimisation; set theory; combinatorial theory; difference sets; distributed mutual exclusion; distributed systems; geometry; grid based quorum scheme; network; quorum based algorithms; quorum size; suboptimal algorithms; Algorithm design and analysis; Communication networks; Computer science; Costs; Distributed computing; Search methods; Supercomputers; Testing; Tin;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1997., Proceedings of the 17th International Conference on
Conference_Location
Baltimore, MD
ISSN
1063-6927
Print_ISBN
0-8186-7813-5
Type
conf
DOI
10.1109/ICDCS.1997.597862
Filename
597862
Link To Document