Performance models of timestamp-ordering concurrency control algorithms in distributed databases

Journal Article · Tue Sep 01 00:00:00 EDT 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.5009535· OSTI ID:6119976

Li, V O.K.

A distributed database (DDB) consists of copies of data files (usually redundant) geographically distributed and managed on a computer network. One important problem in DDB research is that of concurrency control. This paper develops a performance model of timestamp-ordering concurrency control algorithms in a DDB. The performance model consists of five components: input data collection, transaction processing model, communication subnetwork model, conflict model, and performance measures estimation. In this paper the author describes the conflict model in detail. They first determine the probability of transaction restarts, the probability of transaction blocking, and the delay due to blocking for the basic timestamp-ordering algorithm. They then develop conflict models for variations of the basic algorithm. These conflict models are illustrated by numerical examples.

• Research Organization: Dept. of Electrical Engineering, Univ. of Southern California, Los Angeles, CA 90089
• OSTI ID: 6119976
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. C-36:9; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
COMPUTER NETWORKS
CONTROL THEORY
DATA ACQUISITION
DATA BASE MANAGEMENT
DATA PROCESSING
DATA TRANSMISSION SYSTEMS
MANAGEMENT
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
PARALLEL PROCESSING
PERFORMANCE
PROBABILITY
PROCESSING
PROGRAMMING
RESEARCH PROGRAMS
TIME DEPENDENCE