Roles of Resource and Data Contention on the Performance of Replicated Distributed Database Systems

Roles of Resource and Data Contention on the Performance of Replicated Distributed Database Systems

Kam-Yiu Lam (City Polytechnic of Hong Kong, Hong Kong) and Sheung-Lun Hung (City Polytechnic of Hong Kong, Hong Kong)
Copyright: © 1993 |Pages: 14
DOI: 10.4018/jdm.1993010103
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

The consistency problem in replicated distributed database systems is complicated by the requirement to ensure mutual consistency across the nodes. Traditionally, it is solved by the semi-distributed approach in which all computations of a transaction are carried out at the site of its origination. In this paper, the impact of resource and data contention on the performance of Semi-distributed Algorithm (SDA) has been studied and is compared with Fully-distributed Algorithm (FDA) under different degree of communication overheads with the objective of obtaining some practical guidelines for the design of such systems. Centralized Static Two Phase Locking (CS2PL) is the concurrency control protocol adopted in both models to ensure the serializability of transactions. Results indicate that for both algorithms, data contention rather than resource contention is the dominant factor in affecting the system performance especially when granularity of database is fine. The study also suggests that SDA is more suitable for systems with low communication overheads whereas FDA performs better for systems with high resource contention in communication links and small transaction sizes. FDA has the additional advantage of greater tolerance towards unreliable networks.

Complete Article List

Search this Journal:
Reset
Open Access Articles
Volume 28: 4 Issues (2017)
Volume 27: 4 Issues (2016)
Volume 26: 4 Issues (2015)
Volume 25: 4 Issues (2014)
Volume 24: 4 Issues (2013)
Volume 23: 4 Issues (2012)
Volume 22: 4 Issues (2011)
Volume 21: 4 Issues (2010)
Volume 20: 4 Issues (2009)
Volume 19: 4 Issues (2008)
Volume 18: 4 Issues (2007)
Volume 17: 4 Issues (2006)
Volume 16: 4 Issues (2005)
Volume 15: 4 Issues (2004)
Volume 14: 4 Issues (2003)
Volume 13: 4 Issues (2002)
Volume 12: 4 Issues (2001)
Volume 11: 4 Issues (2000)
Volume 10: 4 Issues (1999)
Volume 9: 4 Issues (1998)
Volume 8: 4 Issues (1997)
Volume 7: 4 Issues (1996)
Volume 6: 4 Issues (1995)
Volume 5: 4 Issues (1994)
Volume 4: 4 Issues (1993)
Volume 3: 4 Issues (1992)
Volume 2: 4 Issues (1991)
Volume 1: 2 Issues (1990)
View Complete Journal Contents Listing