Regeneration with Virtual Copies for Distributed Computing Systems

Nabil R. Adam, Rajiv Tewari

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We consider the consistency control problem for replicated data in a distributed computing system (DCS) and propose a new algorithm to dynamically regenerate copies of data objects in response to node failures and network partitioning in the system. The DCS is assumed to have strict consistency constraints for data object copies. The new algorithm combines the advantages of voting based algorithms and regeneration mechanisms to maintain mutual consistency of replicated data objects in the case of node failures and network partitioning. Our algorithm extends the feasibility of regeneration to DCS on wide area networks, and is able to satisfy user queries as long as there is one current partition in the system. A stochastic availability analysis of our algorithm shows that it provides improved availability as compared to previously proposed dynamic voting algorithms.

Original languageEnglish (US)
Pages (from-to)594-602
Number of pages9
JournalIEEE Transactions on Software Engineering
Volume19
Issue number6
DOIs
StatePublished - Jun 1993

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Availability distributed computing systems mutual consistency network partitioning regeneration replicated data
  • Index Terms—

Fingerprint Dive into the research topics of 'Regeneration with Virtual Copies for Distributed Computing Systems'. Together they form a unique fingerprint.

Cite this