Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A dynamic majority determination algorithm for reconfiguration of network partitions
Information Sciences: an International Journal
A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability
IEEE Transactions on Software Engineering
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Markov regenerative stochastic Petri nets
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
IEEE Transactions on Software Engineering
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Byzantine generals in action: implementing fail-stop processors
ACM Transactions on Computer Systems (TOCS)
Performance Modelling with Deterministic and Stochostic Petri Nets
Performance Modelling with Deterministic and Stochostic Petri Nets
Constructing Dependable Web Services
IEEE Internet Computing
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
IEEE Transactions on Knowledge and Data Engineering
A New Dynamic Voting Algorithm for Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
SPNP: Stochastic Petri Net Package
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Analyzing dynamic voting using Petri nets
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Hi-index | 0.00 |
We analyze reconfigurable algorithms for managing replicated data to determine how often one should detect and react to failure conditions so that reorganization operations can be performed at the appropriate time to improve the availability of replicated data. We use dynamic voting as a case study to reveal design trade-offs for designing such reconfigurable algorithms and illustrate how often failure detection and reconfiguration activities should be performed so as to maximize data availability. Stochastic Petri nets are used as a tool to facilitate our analysis.