How to assign votes in a distributed system
Journal of the ACM (JACM)
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
An all pairs shortest path algorithm with expected time O(n2logn)
SIAM Journal on Computing
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
An Analysis of the Average Message Overhead in Replica Control Protocols
IEEE Transactions on Parallel and Distributed Systems
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Communications of the ACM
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
Obtaining Coteries That Optimize the Availability of Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
A Delay-Optimal Quorum-Based Mutual Exclusion Scheme with Fault-Tolerance Capability
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Optimal coteries for rings and related networks
Distributed Computing
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Dynamic grid quorum: a reconfigurable grid quorum and its power optimization algorithm
Service Oriented Computing and Applications
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
The use of quorums is a well-known approach to achieving mutual exclusion in distributed computing systems. This approach works based on a coterie, a special set of node groups where any pair of the node groups shares at least one common node. Each node group in a coterie is called a quorum. Mutual exclusion is ensured by imposing that a node gets consensus from all nodes in at least one of the quorums before it enters a critical section. In a quorum-based mutual exclusion scheme, the delay for reaching consensus depends critically on the coterie adopted and, thus, it is important to find a coterie with small delay. In [5], Fu introduced two related measures called max-delay and mean-delay. The former measure represents the largest delay among all nodes, while the latter is the arithmetic mean of the delays. She proposed polynomial-time algorithms for finding max-delay and mean-delay optimal coteries when the network topology is a tree or a ring. In this paper, we first propose a polynomial-time algorithm for finding max-delay optimal coteries and, then, modify the algorithm so as to reduce the mean-delay of generated coteries. Unlike the previous algorithms, the proposed algorithms can be applied to systems with arbitrary topology.