Repairman models for replicated data management: A case study
- Univ. of North Florida, Jacksonville, FL (United States)
- National Cheng Kung Univ., Tainan (Taiwan, Province of China)
Pessimistic control algorithms for replicated data permit only one partition to perform update operations at any time so as to ensure mutual exclusion of the replicated data object. Existing availability modeling and analyses of pessimistic control algorithms are constrained to either site-failure or link-failure only models, but not both, because of the large state space which needs to be considered. Moreover, the assumption of having an independent repairman for each link and each site has been made to reduce the complexity of analysis. In this paper, we remove these restrictions with the help of stochastic Petri nets. In particular, we investigate the effect of repair dependency which occurs when sites and links may have to share the same repairman. Four repairman models are examined in the paper: (a) independent repairman with one repairman assigned to each link and each node; (b) dependent repairman with FIFO servicing discipline; (c) dependent repairman with linear-order servicing discipline; and (d) dependent repairman with best-first servicing discipline. Using dynamic voting as a case study, we compare and contrast the resulting availabilities due to the use of these four different repairman models and give a physical interpretation of the differences.
- OSTI ID:
- 535552
- Report Number(s):
- CONF-961209-; CNN: Grant NSC86-2745-E0006-020; TRN: 97:003191-0015
- Resource Relation:
- Conference: 4. international conference on parallel and distributed information systems, Miami Beach, FL (United States), 18-20 Dec 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the fourth international conference on parallel and distributed information systems; PB: 307 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimizing voting-type algorithms for replicated data
Cost and availability tradeoffs in replicated data concurrency control