This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Real-Time Locking Protocol
July 1991 (vol. 40 no. 7)
pp. 793-800

The authors examine a priority driven two-phase lock protocol called the read/write priority ceiling protocol. It is shown that this protocol leads to freedom from mutual deadlock. In addition, a high-priority transactions can be blocked by lower priority transactions for at most the duration of a single embedded transaction. These properties can be used by schedulability analysis to guarantee that a set of periodic transactions using this protocol can always meet its deadlines. Finally, the performance of this protocol is examined for randomly arriving transactions using simulation studies.

[1] R. Abbott and H. Garcia-Molina, "Scheduling real-time transactions: A performance study," inProc. VLDB Conf., Sept. 1988, pp. 1-12.
[2] P. A. Bernstein, D. W. Shipman, and W. S. Wong, "Formal aspects of serializability in database concurrency control,"IEEE Trans. Software Eng., 1979, pp. 203-216.
[3] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[4] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[5] H. Garcia-Molina, "Using semantic knowledge for transaction processing in a distributed database,"ACM Trans. Database Syst., vol. 8, no. 2, June 1983.
[6] J. Gray, "The transaction concept: Virtues and limitations," inProc. 7th Int. Conf. Very Large Database, 1981.
[7] B. W. Lampson and D. D. Redell, "Experiences with processes and monitors in Mesa,"Commun. ACM, vol. 23, no. 2, pp. 105-117, Feb. 1980.
[8] J. P. Lehoczky, L. Sha, and J. Strosnider, "Enhancing aperiodic responsiveness in a hard real-time environment," inProc. IEEE Real-Time Syst. Symp., 1987.
[9] D. W. Leinbaugh, "Guaranteed response time in a hard real-time environment,"IEEE Trans. Software Eng., Jan. 1980.
[10] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[11] A. K. Mok, "Fundamental design problems of distributed systems for the hard real time environment," Ph.D. dissertation, M.I.T., 1983.
[12] C. H. Papadimitriou and P. C. Kanellakis, "On concurrency control by multiple versions,"ACM Trans. Database Syst., Mar. 1984.
[13] C.H. Papadimitriou,The Theory of Database Concurrency Control. Rockville, MD: Computer Science Press, 1986.
[14] L. Sha, R. Rajkumar, and J. P. Lehoczky, "Priority inheritance protocols: An approach to real-time synchronization," Tech. Rep., Dep. Comput. Sci., CMU, 1987.IEEE Trans. Comput., vol. 39, pp. 1175-1185, Sept. 1990.
[15] S. H. Son, "An environment for prototyping real-time distributed data-base," inProc. Int. Conf. Syst. Integration, Apr. 1990.
[16] W. Zhao, K. Ramamritham, and J. A. Stankovic, "Preemptive scheduling under time and resource constraints,"IEEE Trans. Comput., Aug. 1987.

Index Terms:
priority driven; two-phase lock protocol; read/write priority ceiling protocol; schedulability analysis; periodic transactions; concurrency control; database theory; protocols; transaction processing.
Citation:
L. Sha, R. Rajkumar, S.H. Son, C.-H. Chang, "A Real-Time Locking Protocol," IEEE Transactions on Computers, vol. 40, no. 7, pp. 793-800, July 1991, doi:10.1109/12.83617
Usage of this product signifies your acceptance of the Terms of Use.