DocumentCode :
1411271
Title :
Recognizing nondominated coteries and wr-coteries by availability
Author :
Kuo, Yu-Chen ; Huang, Shing-Tsaan
Author_Institution :
Dept. of Comput. & Inf. Sci., Soochow Univ., Taipei, Taiwan
Volume :
9
Issue :
8
fYear :
1998
fDate :
8/1/1998 12:00:00 AM
Firstpage :
721
Lastpage :
728
Abstract :
Coterie is a widely accepted concept for solving the mutual exclusion problem. Nondominated coteries are an important class of coteries which have better performance than dominated coteries. The performance of a coterie is usually measured by availability. Higher availability of a coterie exhibits greater ability to tolerate node or communication link failures. In this paper, we demonstrate a way to recognize nondominated coteries using availability. By evaluating the availability of a coterie instead of using a formal proof, the coterie can be recognized as a nondominated coterie or not. Moreover, with regard to wr-coterie, a concept for solving the replica control problem, we also present a similar result for recognizing nondominated wr-coteries. Finally, we apply our results to some well-known coteries and wr-coteries
Keywords :
concurrency control; distributed algorithms; fault tolerant computing; availability; coteries; distributed algorithms; fault tolerance; mutual exclusion; replica control; wr-coteries; Availability; Boolean functions; Communication system control; Costs; Distributed algorithms; Fault tolerance; Neodymium; Permission; Size measurement; Voting;
fLanguage :
English
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1045-9219
Type :
jour
DOI :
10.1109/71.706045
Filename :
706045
Link To Document :
بازگشت