On fault-tolerant data replication in distributed systems

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)301-309
Number of pages9
JournalMicroprocessors and Microsystems
Volume26
Issue number7
DOIs
Publication statusPublished - Sep 10 2002

Fingerprint

Adaptive algorithms
Availability
Internet

Keywords

  • Comparative analysis
  • Distributed systems
  • Dynamic data replication
  • Fault tolerance

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

On fault-tolerant data replication in distributed systems. / Tenzekhti, Fathi; Day, Khaled; Ould-Khaoua, Mohamed.

In: Microprocessors and Microsystems, Vol. 26, No. 7, 10.09.2002, p. 301-309.

Research output: Contribution to journalArticle

@article{28e675d877cd4b2eafca4ccb9ad1e858,
title = "On fault-tolerant data replication in distributed systems",
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.",
keywords = "Comparative analysis, Distributed systems, Dynamic data replication, Fault tolerance",
author = "Fathi Tenzekhti and Khaled Day and Mohamed Ould-Khaoua",
year = "2002",
month = "9",
day = "10",
doi = "10.1016/S0141-9331(02)00037-6",
language = "English",
volume = "26",
pages = "301--309",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - On fault-tolerant data replication in distributed systems

AU - Tenzekhti, Fathi

AU - Day, Khaled

AU - Ould-Khaoua, Mohamed

PY - 2002/9/10

Y1 - 2002/9/10

N2 - 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.

AB - 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.

KW - Comparative analysis

KW - Distributed systems

KW - Dynamic data replication

KW - Fault tolerance

UR - http://www.scopus.com/inward/record.url?scp=0037056207&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037056207&partnerID=8YFLogxK

U2 - 10.1016/S0141-9331(02)00037-6

DO - 10.1016/S0141-9331(02)00037-6

M3 - Article

AN - SCOPUS:0037056207

VL - 26

SP - 301

EP - 309

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 7

ER -