Title :
k-coteries for fault-tolerant k entries to a critical section
Author :
Huang, Shing-Tsaan ; Jiang, Jehn-Ruey ; Kuo, Yu-Chen
Author_Institution :
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
Abstract :
The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections
Keywords :
concurrency control; distributed algorithms; fault tolerant computing; resource allocation; 1-entry critical sections; Cohorts; access control; communication cost; critical section; distributed systems; fault-tolerant k entries; k-coteries; network partitioning; node failures; quorums; Access control; Broadcasting; Computer science; Contracts; Costs; Councils; Distributed algorithms; Fault tolerance; Fault tolerant systems; Resilience;
Conference_Titel :
Distributed Computing Systems, 1993., Proceedings the 13th International Conference on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
0-8186-3770-6
DOI :
10.1109/ICDCS.1993.287721
