Abstract
This paper presents a new fault-tolerant algorithm for dynamic data replication in distributed systems. The algorithm presents remedies to the deficiencies of the existing adaptive data replication (ADR) and the primary missing writes (PMW) algorithms, proposed in [ACM Trans. Database Syst. 22 (1997) 255]. The new algorithm extends the idea of PMW to allow the adaptive replication algorithm to be used in the presence of failures, and introduces new mechanisms for maximising object availability. Results from a comparative analysis reveal that our algorithm outperforms the ADR/PMW especially in a read intensive environment like the Internet.
Original language | English |
---|---|
Pages (from-to) | 301-309 |
Number of pages | 9 |
Journal | Microprocessors and Microsystems |
Volume | 26 |
Issue number | 7 |
DOIs | |
Publication status | Published - Sept 10 2002 |
Keywords
- Comparative analysis
- Distributed systems
- Dynamic data replication
- Fault tolerance
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence