Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
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 quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
IEEE Transactions on Software Engineering
Efficient solution to the distributed mutual exclusion problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Exploiting logical structures in replicated databases
Information Processing Letters
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Achieving robustness in distributed database systems
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Consistency and recovery control for replicated files
Proceedings of the tenth ACM symposium on Operating systems principles
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Efficient Dynamic Voting Algorithms
Proceedings of the Fourth International Conference on Data Engineering
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
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
An Analysis of the Average Message Overhead in Replica Control Protocols
IEEE Transactions on Parallel and Distributed Systems
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Distributed and Parallel Databases
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
Analyzing dynamic voting using Petri nets
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
A delay optimal coterie on the k-dimensional folded Petersen graph
Journal of Parallel and Distributed Computing
Analyzing reconfigurable algorithms for managing replicated data
Journal of Systems and Software
Replication algorithms for the World-Wide Web
Journal of Systems Architecture: the EUROMICRO Journal
A new algorithm for increasing fault-tolerance of distributed systems
CSN '07 Proceedings of the Sixth IASTED International Conference on Communication Systems and Networks
Proxy agent based replication control model for wireless internet
Information Sciences: an International Journal
Making data-centric storage adaptive and cost-optimal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Info-based approach in distributed mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper, we examine the tradeoff between message overhead and data availability that arises in the design of fault-tolerant algorithms for replicated data management in distributed systems. We propose a property called asymptotically high resiliency which is useful for evaluating the fault-tolerance of replica control algorithms and distributed mutual exclusion algorithms. We present a new algorithm for replica control that can be tailored (through a design parameter) to achieve the desired balance between low message overhead and high data availability. Further, we show that for a message overhead of ${\bf O}(\sqrt{N{\rm log}N})$, our algorithm can achieve asymptotically high resiliency.