The Community for Technology Leaders
Green Image
<p>The authors 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 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. The 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 the algorithm shows that it provides improved availability as compared to previously proposed dynamic voting algorithms.</p>
distributed databases; virtual copies; consistency control problem; replicated data; distributed computing system; node failures; network partitioning; consistency constraints; data object copies; voting-based algorithms; regeneration mechanisms; wide area networks; user queries; stochastic availability analysis; dynamic voting algorithms; distributed databases; query processing

R. Tewari and N. Adam, "Regeneration with Virtual Copies for Distributed Computing Systems," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 594-602, 1993.
80 ms
(Ver 3.3 (11022016))