Using multicast communication to reduce deadlock in replicated databases

JoAnne Holliday, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingChapter

11 Citations (Scopus)

Abstract

Obtaining good performance from a distributed replicated database that allows update transactions to originate at any site while ensuring one-copy serializability is a challenge. A popular analysis of deadlock probabilities in replicated databases shows that the deadlock rate for the system is high and increases as the third power of the number of replicas. We show how a replica management protocol that uses atomic broadcast for replica update reduces the occurrence of deadlocks and the dependency on the number of replicas. The analysis is confirmed by simulation experiments.

Original languageEnglish
Title of host publicationProceedings of the IEEE Symposium on Reliable Distributed Systems
PublisherIEEE
Pages196-205
Number of pages10
Publication statusPublished - 2000
Externally publishedYes
EventThe 19th IEEE Symposium on Reliable Distributed Systems (SRDS-2000) - Nurnberg, Ger
Duration: 16 Oct 200018 Oct 2000

Other

OtherThe 19th IEEE Symposium on Reliable Distributed Systems (SRDS-2000)
CityNurnberg, Ger
Period16/10/0018/10/00

Fingerprint

Communication
Experiments

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Holliday, J., Agrawal, D., & El Abbadi, A. (2000). Using multicast communication to reduce deadlock in replicated databases. In Proceedings of the IEEE Symposium on Reliable Distributed Systems (pp. 196-205). IEEE.

Using multicast communication to reduce deadlock in replicated databases. / Holliday, JoAnne; Agrawal, Divyakant; El Abbadi, Amr.

Proceedings of the IEEE Symposium on Reliable Distributed Systems. IEEE, 2000. p. 196-205.

Research output: Chapter in Book/Report/Conference proceedingChapter

Holliday, J, Agrawal, D & El Abbadi, A 2000, Using multicast communication to reduce deadlock in replicated databases. in Proceedings of the IEEE Symposium on Reliable Distributed Systems. IEEE, pp. 196-205, The 19th IEEE Symposium on Reliable Distributed Systems (SRDS-2000), Nurnberg, Ger, 16/10/00.
Holliday J, Agrawal D, El Abbadi A. Using multicast communication to reduce deadlock in replicated databases. In Proceedings of the IEEE Symposium on Reliable Distributed Systems. IEEE. 2000. p. 196-205
Holliday, JoAnne ; Agrawal, Divyakant ; El Abbadi, Amr. / Using multicast communication to reduce deadlock in replicated databases. Proceedings of the IEEE Symposium on Reliable Distributed Systems. IEEE, 2000. pp. 196-205
@inbook{4ded7a79944740d4b77367016c465913,
title = "Using multicast communication to reduce deadlock in replicated databases",
abstract = "Obtaining good performance from a distributed replicated database that allows update transactions to originate at any site while ensuring one-copy serializability is a challenge. A popular analysis of deadlock probabilities in replicated databases shows that the deadlock rate for the system is high and increases as the third power of the number of replicas. We show how a replica management protocol that uses atomic broadcast for replica update reduces the occurrence of deadlocks and the dependency on the number of replicas. The analysis is confirmed by simulation experiments.",
author = "JoAnne Holliday and Divyakant Agrawal and {El Abbadi}, Amr",
year = "2000",
language = "English",
pages = "196--205",
booktitle = "Proceedings of the IEEE Symposium on Reliable Distributed Systems",
publisher = "IEEE",

}

TY - CHAP

T1 - Using multicast communication to reduce deadlock in replicated databases

AU - Holliday, JoAnne

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

PY - 2000

Y1 - 2000

N2 - Obtaining good performance from a distributed replicated database that allows update transactions to originate at any site while ensuring one-copy serializability is a challenge. A popular analysis of deadlock probabilities in replicated databases shows that the deadlock rate for the system is high and increases as the third power of the number of replicas. We show how a replica management protocol that uses atomic broadcast for replica update reduces the occurrence of deadlocks and the dependency on the number of replicas. The analysis is confirmed by simulation experiments.

AB - Obtaining good performance from a distributed replicated database that allows update transactions to originate at any site while ensuring one-copy serializability is a challenge. A popular analysis of deadlock probabilities in replicated databases shows that the deadlock rate for the system is high and increases as the third power of the number of replicas. We show how a replica management protocol that uses atomic broadcast for replica update reduces the occurrence of deadlocks and the dependency on the number of replicas. The analysis is confirmed by simulation experiments.

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

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

M3 - Chapter

SP - 196

EP - 205

BT - Proceedings of the IEEE Symposium on Reliable Distributed Systems

PB - IEEE

ER -