Issue No. 02 - February (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.565603
<p><b>Abstract</b>—We propose a structure named <it>Cohorts</it> to solve the problem of the access control of multiple entries to a critical section. Our solution is formalized as forming quorums in a <it>k</it>-coterie. It is resilient to node failures and/or network partitioning, invokes constant expected message cost and has comparably high availability.</p>
Availability, coteries, distributed systems, fault-tolerance, mutual exclusion, quorums.
Jehn-Ruey Jiang, Shing-Tsaan Huang, Yu-Chen Kuo, "Cohorts Structures for Fault-Tolerant k Entries to a Critical Section", IEEE Transactions on Computers, vol. 46, no. , pp. 222-228, February 1997, doi:10.1109/12.565603