How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
A distributed algorithm for mutual exclusion in an arbitrary network
The Computer Journal
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A distributed algorithm for multiple entries to a critical section
Information Processing Letters
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
Another distributed algorithm for multiple entries to a critical section
Information Processing Letters
A distributed k-mutual exclusion algorithm using k-coterie
Information Processing Letters
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Discrete Mathematics
IEEE Transactions on Computers
Distributed k-Mutual Exclusion Problem and k-Coteries
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Recognizing Nondominated Coteries and wr-Coteries by Availability
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Optimal k-Coteries That Maximize Availability in General Networks
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
Theoretical Computer Science
On the Nondomination of Cohorts Coteries
IEEE Transactions on Computers
Comments on "On the Nondomination of Cohorts Coteries"
IEEE Transactions on Computers
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
A distributed token based h-out of-k Mutual Exclusion protocol for mobile ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Nondominated local coteries for resource allocation in grids and clouds
Information Processing Letters
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Quorum-based key management scheme in wireless sensor networks
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 14.99 |
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.