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
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
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
Reconfigurable Object Consistency Model
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
Reconfigurable Consistency Algorithm
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Reconfigurable object consistency model for distributed shared memory
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
In this paper, we address reconfigurable algorithms for managing replicated data with strict consistency requirements, that is, whenever the user performs an update operation, the update is applied to all reachable copies as part of the update protocol. A key issue of designing such algorithms is to determine ho w 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. In this paper, we use dynamic voting as a case study to illustrate how often such failure detection and reconfiguration activities should be performed so as to maximum the data availability. The paper shows that there exists an optimal period at which the failure detection and reconfiguration activities should be performed to optimize the system availability. Stochastic Petri nets (SPNs) are used as a tool to facilitate our analysis.