loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Workshop on Real-Time Computing Systems Application (RTCSA'96)
Impact of priority assignment on optimistic concurrency control in distributed real-time databases
Seoul, Korea
October 30-November 01
ISBN: 0-8186-7626-4
ASCII Text
x 
 
Kam-Yiu Lam, V.C.S. Lee, Sheung-Lun Hung, B.C.M. Kao, "Impact of priority assignment on optimistic concurrency control in distributed real-time databases," Real-Time Computing Systems and Applications, International Workshop on, pp. 128, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.1996.554969,
author = {Kam-Yiu Lam and V.C.S. Lee and Sheung-Lun Hung and B.C.M. Kao},
title = {Impact of priority assignment on optimistic concurrency control in distributed real-time databases},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {1996},
isbn = {0-8186-7626-4},
pages = {128},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1996.554969},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - Impact of priority assignment on optimistic concurrency control in distributed real-time databases
SN - 0-8186-7626-4
SP
EP
A1 - Kam-Yiu Lam,
A1 - V.C.S. Lee,
A1 - Sheung-Lun Hung,
A1 - B.C.M. Kao,
PY - 1996
KW - concurrency control; priority assignment; optimistic concurrency control; distributed real-time databases; real-time concurrency control protocols; earliest deadline first; CPU scheduling algorithm; performance; priority assignment heuristics; deadline constraint; data contention
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Kam-Yiu Lam, Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, Hong Kong
V.C.S. Lee, Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, Hong Kong
Sheung-Lun Hung, Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, Hong Kong
B.C.M. Kao, Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, Hong Kong
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.
Index Terms:
concurrency control; priority assignment; optimistic concurrency control; distributed real-time databases; real-time concurrency control protocols; earliest deadline first; CPU scheduling algorithm; performance; priority assignment heuristics; deadline constraint; data contention
Citation:
Kam-Yiu Lam, V.C.S. Lee, Sheung-Lun Hung, B.C.M. Kao, "Impact of priority assignment on optimistic concurrency control in distributed real-time databases," rtcsa, pp.128, Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), 1996
Usage of this product signifies your acceptance of the Terms of Use.