Analyzing reconfigurable algorithms for managing replicated data

  • Authors:
  • Ing-Ray Chen;Ding-Chau Wang;Chih-Ping Chu

  • Affiliations:
  • Department of Computer Science, Virginia Polytechnic Institute and State University, Northern Virginia Center, 7054 Haycock Road, Falls Church, VA;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 70101, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 70101, Taiwan

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.