ACTIVE-A Real Time Commit Protocol


Many existing real time commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from sending WORKDONE/PREPARED message and restrict them from lending data so that transaction abort chain is limited to one. Thus, transaction execution time increases. This paper proposes a modified real time commit protocol for distributed real time database systems (DRTDBS), Allow Commit Dependent and in Time borrowers for Incredible Value added data lending without extended abort chain (ACTIVE), where borrower cohorts are categorized as commit and abort dependent. Further, the commit dependent borrowers can lend data to executing cohorts with still limiting the transaction abort chain to one only and reducing the data inaccessibility. Also, an incoming executing cohort having borrowing factor greater than one can only borrow the dirty data items from lender. This minimizes the fruitless borrowing by the cohort. The performance of ACTIVE is compared with PROMPT, 2SC and SWIFT protocols for both main memory resident and disk resident databases with and without communication delay. Simulation results show that the proposed protocol improves the system performance up to 4% as transaction miss percentage.

Share and Cite:

U. Shanker, N. Agarwal, S. Tiwari, P. Goel and P. Srivastava, "ACTIVE-A Real Time Commit Protocol," Wireless Sensor Network, Vol. 2 No. 3, 2010, pp. 254-263. doi: 10.4236/wsn.2010.23035.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] Y. Lam, C-L. Pang, S. H. Son, and J. Cao, “Resolving executing-committing conflicts in distributed real-time database systems,” Computer Journal, Vol. 42, No. 8, pp. 674–692, 1999.
[2] C.-L. Pang and K. Y. Lam, “On using similarity for resolving conflicts at commit in mixed distributed real-time databases,” Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications, 1998.
[3] G. K. Attaluri and K. Salem, “The presumed-either two- phase commit protocol,” IEEE Transactions on Knowledge and Data Engineering, Vol. 14, No. 5, pp. 1190– 1196, 2002.
[4] J. Gray and A. Reuter, “Transaction processing: Concepts and technique,” Morgan Kaufman, San Mateo, California, 1993.
[5] J. Gray, “Notes on database operating systems,” Operating Systems: An Advanced Course, Lecture Notes in Computer Science, Springer Verlag, Vol. 60, pp. 397– 405, 1978.
[6] P. Misikangas, “2PL and its variants,” Seminar on Real- Time Systems, Department of Computer Science, University of Helsinki, 1997.
[7] I. Lee and Y. H. Yeom, “A single phase distributed commit protocol for main memory database systems,” 16th International Parallel & Distributed Processing Symposium (IPDPS), Ft. Lauderdale, Florida, USA, 2002.
[8] C. Mohan, B. Lindsay, and R. Obermarck, “Transaction management in the R* distributed database management system,” ACM transaction on Database Systems, Vol. 11, No. 4, 1986.
[9] N. Soparkar, E. Levy, H. F. Korth, and A. Silberschatz, “Adaptive commitment for real-time distributed transaction,” Technical Report TR-92–15, Department of Computer Science, University of Texax, Austinm, 1992.
[10] R. Gupta, J. R. Haritsa, and K. Ramamritham, “More optimism about real-time distributed commit processing,” Technical Report TR–97-Database System Lab, Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India, 1997.
[11] R. Gupta, J. R. Haritsa, K. Ramamritham, and S. Seshadri, “Commit processing in distributed real time database systems,” Proceedings of Real-Time Systems Symposium, IEEE Computer Society Press, Washington DC, San Francisco, 1996.
[12] J. R. Haritsa, K. Ramamritham, and R. Gupta, “The PROMPT real time commit protocol,” IEEE Transaction on Parallel and Distributed Systems, Vol. 11, No. 2, pp. 160–181, 2000.
[13] U. Shanker, M. Misra, and A. K. Sarje, “Distributed real time database systems: Background and literature review,” International Journal of Distributed and Parallel Databases, Springer Verlag, Vol. 23, No. 2, pp. 127–149, 2008.
[14] B. Qin and Y. Liu, “High performance distributed real time commit protocol,” Journal of Systems and Software, Elsevier Science Inc., pp. 1–8, 2003.
[15] K. Ramamritham and P. K. Chrysanthis, “A taxonomy of correctness criteria in data-base applications,” Journal of the Very Large Data Bases, Vol. 5, pp. 85–97, 1996.
[16] B. Qin, Y. Liu, and J. Yang, “A commit strategy for distributed real-time transaction,” Journal of Computer Science and Technology, Vol. 18, No. 5, pp. 626–631, 2003.
[17] U. Shanker, M. Misra and A. K. Sarje, “SWIFT - a new real time commit protocol,” International Journal of Distributed and Parallel Databases, Springer Verlag, Vol. 20, No. 1, pp. 29–56, 2006.
[18] U. Shanker, M. Misra, A. K. Sarje and R. Shisondia, “Dependency sensitive shadow SWIFT,” Proceedings of the 10th International Database Applications and Engineering Symposium, Delhi, India, pp. 373–276, 2006.
[19] O. Ulusoy, “Concurrency control in real time database systems,” PhD Thesis, Department of Computer Science, University of Illinois Urbana-Champaign, 1992.
[20] U. Shanker, M. Misra, and A. K. Sarje, “Hard real-time distributed database systems: Future directions,” Communication Network, Department of Electronics & Computer Engineering, Indian Institute of Technology Roorkee, India, pp. 172–177, 2001.
[21] D. Agrawal, A. El Abbadi, R. Jeffers and L. Lin, “Ordered shared locks for real-time databases,” International Journals of Very Large Data Bases, Vol. 4, No. 1, pp. 87-126, January 1995.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.