k-coteries for fault-tolerant k entries to a critical section
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
[[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[[fileno]]2030249030005[[department]]資訊工程學This publication has 16 references indexed in Scilit:
- Another distributed algorithm for multiple entries to a critical sectionInformation Processing Letters, 1992
- Algorithms implementing distributed shared memoryComputer, 1990
- A heuristically-aided algorithm for mutual exclusion in distributed systemsIEEE Transactions on Computers, 1989
- A distributed algorithm for multiple entries to a critical sectionInformation Processing Letters, 1989
- A tree-based algorithm for distributed mutual exclusionACM Transactions on Computer Systems, 1989
- The information structure of distributed mutual exclusion algorithmsACM Transactions on Computer Systems, 1987
- A distributed mutual exclusion algorithmACM Transactions on Computer Systems, 1985
- How to assign votes in a distributed systemJournal of the ACM, 1985
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979