Priority assignment in distributed real-time databases using optimistic concurrency control

Author

Lam, K.Y. ; Lee, V.C.S. ; Hung, S.L. ; Kao, B.C.M.

Author_Institution

Dept. of Comput. Sci., City Univ. Hong Kong, Kowloon, Hong Kong

Volume

144

Issue

5

fYear

1997

fDate

9/1/1997 12:00:00 AM

Firstpage

324

Lastpage

330

Abstract

In studies of distributed real-time database systems (DRTDBSs), it is always assumed that earliest deadline first (EDF) is employed as the CPU scheduling algorithm. However, purely using the (ultimate) deadline for priority assignment may not be suitable, because different kinds of transactions, such as global and local transactions, may exist in the system. To improve the performance, more sophisticated assignment heuristics have to be employed. In this paper, the performance of priority assignment heuristics for subtransactions in DRTDBSs using the optimistic concurrency control (OCC) protocol is investigated. It is found that purely deadline-driven heuristics, which suffice for other distributed real-time systems, are not suitable for DRTDBSs. On the other hand, the proposed heuristic, which considers both the deadline constraint and data contention, can give the best performance

Keywords

concurrency control; database theory; distributed databases; processor scheduling; real-time systems; software performance evaluation; CPU scheduling algorithm; data contention; deadline constraint; distributed real-time database systems; earliest-deadline-first algorithm; global transactions; local transactions; optimistic concurrency control protocol; performance; priority assignment heuristics; subtransactions; ultimate deadline;

fLanguage

English

Journal_Title

Computers and Digital Techniques, IEE Proceedings -

Publisher

iet

ISSN

1350-2387

Type

jour

DOI

10.1049/ip-cdt:19971496

Filename

627911