By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
K. -Y. Lam ; Dept. of Comput. Sci., City Univ. Hong Kong, Kowloon, Hong Kong ; V. C. S. Lee ; S. L. Hung ; B. C. M. Kao

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

Published in:

IEE Proceedings - Computers and Digital Techniques  (Volume:144 ,  Issue: 5 )