Title :
Impact of priority assignment on optimistic concurrency control in distributed real-time databases
Author :
Lam, Kam-yiu ; Lee, Victor C S ; Hung, Sheung-lun ; Kao, Benjamin C M
Author_Institution :
Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, Hong Kong
Abstract :
In the studies of real-time concurrency control protocols (RT-CCPs), it is always assumed that earliest deadline first (EDF) is employed as the CPU scheduling algorithm. However, using purely (ultimate) deadline for priority assignment may not be suitable for distributed real-time database systems (DRTDBS) in which there exist different kinds of transactions, such as global and local transactions. In order to improve the performance, different priority assignment heuristics have to be used. In this paper, we have investigated the performance of different priority assignment heuristics for sub-transactions in DRTDBS with optimistic concurrency control (OCC) protocol. If is found that the heuristics, which are suitable for distributed real-time systems, are not suitable for DRTDBS. We find that our proposed heuristic, which considers both deadline constraint and data contention, can give the best performance
Keywords :
concurrency control; distributed databases; performance evaluation; processor scheduling; protocols; CPU scheduling algorithm; data contention; deadline constraint; distributed real-time databases; earliest deadline first; optimistic concurrency control; performance; priority assignment; priority assignment heuristics; real-time concurrency control protocols; Algorithm design and analysis; Computer science; Concurrency control; Database systems; Delay; Distributed databases; Protocols; Real time systems; Scheduling algorithm; Transaction databases;
Conference_Titel :
Real-Time Computing Systems and Applications, 1996. Proceedings., Third International Workshop on
Conference_Location :
Seoul
Print_ISBN :
0-8186-7626-4
DOI :
10.1109/RTCSA.1996.554969
