This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
October 1995 (vol. 7 no. 5)
pp. 786-796

Abstract—We study the performance of concurrency control algorithms in maintaining temporal consistency of shared data in hard real-time systems. In our model, a hard real-time system consists of periodic tasks which are either write-only, read-only or update transactions. Transactions may share data. Data objects are temporally inconsistent when their ages and dispersions are greater than the absolute and relative thresholds allowed by the application. Real-time transactions must read temporally consistent data in order to deliver correct results. Based on this model, we have evaluated the performance of two well-known classes of concurrency control algorithms that handle multiversion data: the two-phase locking and the optimistic algorithms, as well as the rate-monotonic and earliest-deadline-first scheduling algorithms. The effects of using the priority inheritance and stack-based protocols with lock-based concurrency control are also studied.

[1] J.W.S. Liu,K.-J. Lin,, and X. Song,“A position paper on scheduling hard real-time transactions,” Proc. IEEE Workshop Real-Time Operating Systems and Software, May 1988.
[2] X. Song and J.W.S. Liu,“Performance of multiversion concurrency control algorithms in maintaining temporal consistency,” Proc. IEEE 14th Ann. Int’l Computer Software&Applications Conf., pp. 132-139, Oct. 1990.
[3] X. Song and J.W.S. Liu,“How well can data temporal consistency be maintained?” Proc. 1992 IEEE Symp. Computer-Aided Control System Design, Mar. 1992
[4] K. Vidyasankar,“Generalized theory of serializability,” Acta Informatica, vol. 24, pp. 105-119, 1987.
[5] A.K. Mok,“Fundamental design problems of distributed systems for the hard real-time environment,” PhD dissertation, Mass. Inst. of Tech nology, May 1983.
[6] L. Sha, R. Rajkumar, and J. Lehoczky, “Concurrency Control for Distributed Real-Time Databases,” ACM SIGMOD Record, vol. 17, 1988.
[7] S.H. Son and R.P. Cook,“Scheduling and consistency in real-time database systems,” Proc. Sixth IEEE Workshop Real-Time Operating Systems and Software, pp. 42-45, May 1989.
[8] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[9] L. Sha,R. Rajkumar,, and J.P. Lehoczky,“Priority inheritance protocols,” Technical Report CMU-CS-87-181, Carnegie Mellon Univ., Nov. 1987.
[10] M.-I. Chen and K.-J. Lin,“Dynamic priority ceilings: A concurrency control protocol for real-time systems,” Technical Report No. UIUCDCS-R-89-1511, Dept. of Computer Science, Univ. of Illi nois, Apr. 1989.
[11] T.P. Baker, A Stack-Based Resource Allocation Policy for Real-Time Processes Proc. IEEE Real-Time Systems Symp., pp. 191-200, 1990.
[12] R. Abbott and H. Garcia-Molina,“Scheduling real-time transactions: A performance evaluation,” Proc. 14th Int’l Conf. Very Large Data Bases, Aug. 1988.
[13] J. Huang,J.A. Stankovic,D. Towsley,, and K. Ramamritham,“Experimental evaluation of real-time transaction processing,” Proc. 10th IEEE Real-Time Systems Symp. (RTSS), Dec. 1989.
[14] J. Haritsa, M. Livny, and M. Carey, “On Being Optimistic about Real-Time Constraints,” Proc. Ninth ACM Symp. Principles of Database Systems, 1990.
[15] R.T. Snodgrass and I. Ahn, "Temporal Databases," Computer, vol. 19, no. 9, pp. 35-42, Sept. 1986.
[16] B.T. Blaustein,H. Garcia-Molina,D.R. Ries,R.M. Chilenskas,, and C.W. Kaufman,“Maintaining replicated databases even in the presence of network partitions,” Proc. 16th Ann. Electronics&Aerospace Conf. and Exposition, pp. 353-360, Sept. 1983.
[17] C.L. Liu and J.W.S. Liu,Linear Systems Analysis. McGraw Hill, 1975.
[18] M.J. Carey and W.A. Mouhanna, "The Performance of Multiversion Concurrency Control Algorithms," ACM Trans. Computer Systems, vol. 4, no. 4, pp. 338-378, Nov. 1986.
[19] A. Chan and R. Gray,“Implementing distributed real-only transactions,” IEEE Trans. Software Engineering, vol. 11, no. 2, pp. 205-212, Feb. 1985.
[20] D. Menasce and T. Nakanishi,“Optimistic versus pessimistic concurrency control mechanisms in database management systems,” Information Systems, vol. 7, no. 1, 1982.
[21] J. Robinson,“Design of concurrency controls for transaction processing systems,” PhD dissertation, Carnegie Mellon Univ., 1982.
[22] P.A. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems," ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[23] J. Haritsa, M. Carey, and M. Livny, “Dynamic Real-Time Optimistic Concurrency Control,” Proc. 11th IEEE Real-Time Systems Symp., pp. 94-103, Dec. 1991.
[24] J. Huang and J.A. Stankovic,“Concurrency control in real-time database systems: Optimistic scheme vs. two-phase locking,” Technical Report No. 90-66,Univ. of Massachusetts, Amherst, July 1990.
[25] X. Song,“Data temporal consistency in hard real-time systems,” PhD dissertation, Univ. of Illi nois, Urbana-Champaign, May 1992.
[26] J.P. Lehoczky,L. Sha,, and Y. Ding,“The rate monotone scheduling algorithm: Exact characterizations and average case behavior,” Proc. IEEE 10th Real-Time Systems Symp., pp. 166-171, Dec. 1989.

Index Terms:
Data temporal consistency, periodic job model, real-time scheduling, multiversion concurrency control, performance evaluation.
Citation:
Xiaohui (Carol) Song, Jane W.S. Liu, "Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 786-796, Oct. 1995, doi:10.1109/69.469820
Usage of this product signifies your acceptance of the Terms of Use.