This Article 
 Bibliographic References 
 Add to: 
The PROMPT Real-Time Commit Protocol
February 2000 (vol. 11 no. 2)
pp. 160-181

Abstract—We investigate the performance implications of providing transaction atomicity for firm-deadline real-time applications operating on distributed data. Using a detailed simulation model, the real-time performance of a representative set of classical transaction commit protocols is evaluated. The experimental results show that data distribution has a significant influence on real-time performance and that the choice of commit protocol clearly affects the magnitude of this influence. We also propose and evaluate a new commit protocol, PROMPT (Permits Reading Of Modified Prepared-data for Timeliness), that is specifically designed for the real-time domain. PROMPT allows transactions to “optimistically” borrow, in a controlled manner, the updated data of transactions currently in their commit phase. This controlled borrowing reduces the data inaccessibility and the priority inversion that is inherent in distributed real-time commit processing. A simulation-based evaluation shows PROMPT to be highly successful, as compared to the classical commit protocols, in minimizing the number of missed transaction deadlines. In fact, its performance is close to the best on-line performance that could be achieved using the optimistic lending approach. Further, it is easy to implement and incorporate in current database system software. Finally, PROMPT is compared against an alternative priority inheritance-based approach to addressing priority inversion during commit processing. The results indicate that priority inheritance does not provide tangible performance benefits.

[1] R. Abbott and H. Garcia-Molina,“Scheduling real-time transactions: A performance evaluation,” Proc. 14th Int’l Conf. Very Large Data Bases, Aug. 1988.
[2] R. Agrawal, M.J. Carey, and M. Livny, "Concurrency Control Performance Modeling: Alternatives and Implications," ACM Trans. Database Systems, vol. 12, no. 4, pp. 609-654, Dec. 1987.
[3] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[4] A. Bestavros and S. Braoudakis, “Timeliness via Speculation for Real-Time Databases,” Proc. IEEE Real-Time Systems Symp., Dec. 1994.
[5] B. Bhargava, ed. Concurrency and Reliability in Distributed Database Systems. Van Nostrand Reinhold, 1987.
[6] M.J. Carey and M. Livny, "Distributed Concurrency Control Performance: A Study of Algorithms, Distribution and Replication," Proc. 14th Very Large Data Bases Conf.,Los Angeles, 1988.
[7] P. Chrysantis, G. Samaras, and Y. Al-Houmaily, “Recovery and Performance of Atomic Commit Processing in Distributed Database Systems,” Recovery Mechanisms in Database Systems. V. Kumar and M. Hsu, eds. Prentice Hall, 1998.
[8] S. Davidson, I. Lee, and V. Wolfe, “A Protocol for Timed Atomic Commitment,” Proc. Ninth Int'l Conf. Distributed Computing Systems, 1989.
[9] B.G. Lindsay, L.M. Haas, C. Mohan, P.F. Wilms, and R.A. Yost, “Computation and Communication in R*: A Distributed Database Manager,” ACM Trans. Computer Systems, vol. 2, no. 1, pp. 24-38, 1984.
[10] B. Purimetla et al., “A Study of Distributed Real-Time Active Database Applications,” Proc. IEEE Workshop Parallel and Distributed Real-Time Systems, 1993.
[11] C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz, ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging ACM Trans. Database Systems, vol. 17, no. 1, pp. 94-162, Mar. 1992.
[12] G. Samaras, K. Britton, A. Citron, and C. Mohan, “Two-Phase Commit Optimizations in a Commercial Distributed Environment,” Distributed and Parallel Databases, vol. 3, pp. 325-360, 1995.
[13] J. Huang, J.A. Stankovic, K. Ramamritham, D. Towsley, and B. Purimetla, “On Using Priority Inheritance in Real-Time Databases,” Special Issue of Real-Time Systems J., vol. 4. no. 3, Sept. 1992.
[14] K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger, "The Notions of Consistency and Predicate Locks in a Relational Database System," Comm. ACM, vol. 8, no. 11, pp. 624-633, 1976.
[15] N. Soparkar et al., “Adaptive Commitment for Real-Time DistributedTransactions,” Technical Report TR-92-15, Dept. of Computer Science, Univ. of Texas, Austin, 1992.
[16] J.N. Gray, "Notes on Database Operating Systems" Operating Systems: An Advanced Course, R. Bayer, R.M. Graham, and G. Seegmuller, eds., Lecture Notes in Computer Science 60, Springer-Verlag, Heidelberg, Germany, 1978.
[17] J. Gray, “The Transaction Concept: Virtues and Limitations,” Proc. Seventh Int'l Conf. Very Large Databases, 1981.
[18] R. Gupta, Commit Processing in Distributed On-line and Real-Time Transaction Processing Systems, master's thesis, SERC, Indian Inst. of Science, Mar. 1997.
[19] R. Gupta, J. Haritsa, “Commit Processing in Distributed Real-Time Database Systems,” Proc. Nat'l Conf. Software for Real-Time Systems, Jan. 1996
[20] R. Gupta, J. Haritsa, and K. Ramamritham, “More Optimism about Real-Time Distributed Commit Processing,” Proc. IEEE 19th Real-Time Systems Symp., Dec. 1997.
[21] R. Gupta, J. Haritsa, and K. Ramamritham, “Revisiting Commit Processing Performance in Distributed Database Systems,” Proc. ACM SIGMOD Int'l Conf. Management of Data, May 1997.
[22] R. Gupta, J. Haritsa, “Commit Processing in Distributed Real-Time Database Systems,” Proc. Nat'l Conf. Software for Real-Time Systems, Jan. 1996
[23] T Harder,“Observations on optimistic concurrency control schemes,” Information Systems, vol. 9, no. 2, pp. 111-120, 1984.
[24] M. Turk and A. Pentland, "Face Recognition Using Eigenfaces," Proc. IEEE Conf. on Computer Vision and Pattern Recognition, 1991, pp. 586-591.
[25] J.R. Haritsa,M.J. Carey,, and M. Livny,“Value-based scheduling in real-time database systems,” VLDB J., vol. 2, no. 2, 1993.
[26] W.H. Kohler, "A Survey of Techniques for Synchronization and Recovery in Decentralized Computing Systems," ACM Computing Surveys, vol. 13, no. 2, pp. 149-185, June 1981.
[27] H.T. Kung and J.T. Robinson, "On Optimistic Methods for Concurrency Control," ACM Trans. Database Systems, vol. 6, no. 2, pp. 213-226, June 1981.
[28] K. Lam, Concurrency Control in Distributed Real-Time Database Systems, PhD thesis, City Univ. of Hong Kong, Oct. 1994.
[29] B. Lampson and D. Lomet, “A New Presumed Commit Optimization for Two Phase Commit,” Proc. Int'l Conf. Very Large Data Bases, pp. 630-640, 1993.
[30] B. Lampson and H. Sturgis, “Crash Recovery in a Distributed Data Storage System,” technical report, Xerox Palo Alto Research Center, 1976.
[31] E. Levy,H. Korth,, and A. Silberschatz,“An optimistic commit protocol for distributed transaction management.” Proc. 1991 ACM SIGMOD Intl Conf. Management of Data,Denver, Co., May 1991.
[32] 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.
[33] V.K. Garg and J.E. Wilkes, Wireless and Personal Communication Systems, Prentice-Hall, 1996.
[34] C. Mohan, B. Lindsay, and R. Obermarck, “Transaction Management in R* Distributed Database Management System,” ACM Trans. Database Systems, vol. 11, no. 4, pp. 378–396, Dec. 1986.
[35] T.M. Ozsu and P. Valduriez, Principles of Distributed Database Systems. Prentice Hall, 1991.
[36] L. Sha, R. Rajkumar, and J. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” Technical Report CMU-CS-87-181, Dept. of Computer Science, Carnegie Mellon Univ., 1987.
[37] L. Sha, R. Rajkumar, and J. Lehoczky, “Concurrency Control for Distributed Real-Time Databases,” ACM SIGMOD Record, vol. 17, 1988.
[38] D. Skeen, "Non-Blocking Commit Protocols," Proc. ACM SIGMOD Int'l Conf. Management of Data, ACM Press, New York, 1981, pp. 133-142.
[39] S. Son, “Real-Time Database Systems: A New Challenge,” Data Eng. Bulletin, vol. 13, no. 4, Dec. 1990.
[40] P. Spiro, A. Joshi, and T. Rengarajan, “Designing an Optimized Transaction Commit Protocol,” Digital Technical J., vol. 3, no. 1, 1991.
[41] J.A. Stankovic and W. Zhao,“On real-time transactions,” ACM SIGMOD Record, vol. 17, no. 1, Mar. 1988.
[42] M. Stonebraker, “Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres,” IEEE Trans. Software Eng., vol. 5, no. 3, 1979.
[43] Ö. Ulusoy, “Processing Real-Time Transactions in a Replicated Database System,” J. Distributed and Parallel Databases, vol. 2, no. 4, pp. 405-436, Oct. 1994.
[44] O. Ulusoy, “Research Issues in Real-Time Database Systems,” Technial Report BU-CEIS-94-32, Dept. of Computer Eng. and Information Science, Bilkent Univ., Turkey, 1994.
[45] O. Ulusoy and G.G. Belford,“Real-time lock based concurrency control in a distributed databasesystem,” Proc. 12th Int’l Conf. Distributed Computing Systems, pp. 136-143, 1992.
[46] Y. Yoon, Transaction Scheduling and Commit Processing for Real-Time Distributed Database Systems, PhD thesis, Korea Advanced Inst. Science and Tech nology, May 1994.

Index Terms:
Distributed real-time database, commit protocol, two phase commit, three phase commit, priority inheritance, performance evaluation.
Jayant R. Haritsa, Krithi Ramamritham, Ramesh Gupta, "The PROMPT Real-Time Commit Protocol," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 2, pp. 160-181, Feb. 2000, doi:10.1109/71.841752
Usage of this product signifies your acceptance of the Terms of Use.