How to assign votes in a distributed system
Journal of the ACM (JACM)
Performance analysis of local computer networks
Performance analysis of local computer networks
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
Simulating computer systems: techniques and tools
Simulating computer systems: techniques and tools
Performability Analysis: Measures, an Algorithm, and a Case Study
IEEE Transactions on Computers - Fault-Tolerant Computing
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
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)
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
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Algorithm for Replicated Data Management
Proceedings of the Eighth International Conference on Data Engineering
Applying a Path-Compression technique to Obtain an Efficient Distributed Mutual Exclusion Algorithm
Proceedings of the 3rd International Workshop on Distributed Algorithms
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
An Analysis of the Average Message Overhead in Replica Control Protocols
IEEE Transactions on Parallel and Distributed Systems
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Performance Evaluation of a Consensus Algorithm with Petri Nets
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
| Hi-index | 0.00 |
Quorum attainment protocols are an important part of many mutual exclusion algorithms. Assessing the performance of such protocols in terms of number of messages, as is usually done, may be less significant than being able to compute the delay in attaining the quorum. Some protocols achieve higher reliability at the expense of increased message cost or delay. A unified analytical model which takes into account the network delay and its effect on the time needed to obtain a quorum is presented. A combined performability metric, which takes into account both availability and delay, is defined, and expressions to calculate its value are derived for two different reliable quorum attainment protocols: D. Agrawal and A. El Abbadi's (1991) and Majority Consensus algorithms (R.H. Thomas, 1979). Expressions for the primary site approach are also given as upper bound on performability and lower bound on delay. A parallel version of the Agrawal and El Abbadi protocol is introduced and evaluated. This new algorithm is shown to exhibit lower delay at the expense of a negligible increase in the number of messages exchanged. Numerical results derived from the model are discussed.