Cohorts structures for fault-tolerant k entries to a critical section
Jehn‐Ruey Jiang, Shing‐Tsaan Huang, Yu‐Chen Kuo · IEEE Transactions on Computers · 1997
We propose a structure named Cohorts to solve the problem of the access control of multiple entries to a critical section. Our solution is formalized as forming quorums in a k-coterie. It is resilient to node failures and/or network partitioning, invokes constant expected message cost and has comparably high availability.