Title :
Availability analysis of composite coteries
Author :
Neilsen, Mitchell L. ; Mizuno, Masaaki
Author_Institution :
Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
Abstract :
A collection of quorums is called a coterie. The authors present an algorithm to construct coteries by composing existing coteries. The resulting coteries are called composite coteries. Several different measures may be used to analyze coteries. One of the most commonly used measures is availability. In general, it is difficult to directly compute the availability of coteries in a large system. An efficient method is described to compute the availability of composite coteries, even in a large system.<>
Keywords :
distributed algorithms; fault tolerant computing; protocols; availability analysis; composite coteries; distributed computing; fault tolerance; mutual exclusion; performance quorums; protocols; quorums; Availability; Communication system control; Delay; Distributed computing; Fault tolerant systems; Nominations and elections; Protocols; Size measurement;
Conference_Titel :
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-7803-0605-8
DOI :
10.1109/PCCC.1992.200517