TY - JOUR
T1 - A fault-tolerant h-out of-k mutual exclusion algorithm using cohorts coteries for distributed systems
AU - Jiang, Jehn Ruey
PY - 2004
Y1 - 2004
N2 - In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie - cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the algorithm and compare it with other related ones.
AB - In this paper, we propose a distributed algorithm for solving the h-out of-k mutual exclusion problem with the aid of a specific k-coterie - cohorts coterie. The proposed algorithm is resilient to node and/or link failures, and has constant message cost in the best case. Furthermore, it is a candidate to achieve the highest availability among all the algorithms using k-coteries. We analyze the algorithm and compare it with other related ones.
UR - http://www.scopus.com/inward/record.url?scp=13944275975&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30501-9_57
DO - 10.1007/978-3-540-30501-9_57
M3 - 會議論文
AN - SCOPUS:13944275975
VL - 3320
SP - 267
EP - 273
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SN - 0302-9743
Y2 - 8 December 2004 through 10 December 2004
ER -