DocumentCode :
2673891
Title :
A dynamic probe strategy for quorum systems
Author :
Neilsen, Mitchell L.
Author_Institution :
Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
fYear :
1997
fDate :
27-30 May 1997
Firstpage :
95
Lastpage :
99
Abstract :
A quorum system is a collection of sets called quorums. Any two quorums in a quorum system must have at least one element in common. Quorum systems can be used for many different applications in a distributed system. A quorum system is available, if all elements in at least one quorum ore operational. The elements are probed to determine if they are available. A probe strategy is used to determine the order in which the elements are probed. This paper studies the average case probe complexity, which is defined as the expected number of probes required to determine if a given quorum system is available. Then, two new probe strategies are presented and analyzed. The first strategy is a generalizations of the alternating color strategy, and the second strategy is based on a measure of the relative importance of each element in the system
Keywords :
computational complexity; distributed processing; protocols; alternating color strategy; average case probe complexity; distributed system; dynamic probe strategy; probe strategy; quorum systems; Fault tolerant systems; Nominations and elections; Performance analysis; Probes; Protocols; Wool;
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.597860
Filename :
597860
Link To Document :
بازگشت