Skip to main content
Log in

Scheduling Value-Based Nested Transactions in Distributed Real-Time Database Systems

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Many noticeable studies have focussed on scheduling flat transactions in a distributed real-time database system (RTDBS). However, a nested transaction model has been widely adopted in many real-life applications such as Internet stock trading systems and telecommunications. This work concerns efficiently scheduling real-time nested transactions in a distributed RTDBS. A new real-time scheduler called flexible high reward for nested transactions (FHRN) is proposed. FHRN consists of (1) FHRNp 1 policy to schedule real-time nested transactions and (2) 2PL_HPN to resolve the concurrent data-accessing problem among interleaved nested transactions. Simulation results show that FHRN outperforms these existent real-time schedulers such as random priority (RP), earliest deadline (ED), highest value (HV), hierarchical earliest deadline (HED), and highest reward and urgency (HRU) when an application requires a nested transaction model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Abbott, R., and Garcia-Molina, H. 1988. Scheduling real-time transactions. ACM SIGMOD Record 17(1): 71-81.

    Google Scholar 

  • Abbott, R., and Garcia-Molina, H. 1992. Scheduling real-time transactions: a performance evaluation. ACM Transactions on Database Systems 17(3): 513-560.

    Google Scholar 

  • Agrawal, R., Carey, M. J., and Livny, M. 1987. Concurrency control performance modeling: alternative and implications. ACM Transactions on Database System 12(4): 609-654.

    Google Scholar 

  • Bernstein, P. A., Hadzilacos, V., and Goodman, N. 1987. Concurrency Control and Recovery in Database Systems. California: Addison-Wesley.

    Google Scholar 

  • Bestavros, A., Lin, K. J., and Son, S. H. 1997. Real-Time Database Systems: Issue and Applications. Boston: Kluwer Academic Publishers.

    Google Scholar 

  • Chen, H. R., Chin, Y. H., and Tseng, S. M. 2001. Scheduling value-based transactions in distributed real-time database systems. In Proceedings of the International IEEE Symposium Parallel and Distributed Processing. San Francisco, CA, pp. 978-984.

  • Chen, Y. W., and Gruenwald, L. 1996. Effect of deadline on scheduling nested transactions in distributed real-time database systems. Information Systems 21(1): 103-124.

    Google Scholar 

  • Cram, C. M. 2001. E-Commerce Concepts: Illustrated Introductory. Boston: Course Technology, ISBN: 0619018186.

    Google Scholar 

  • El-Sayed, A. A., Hassanein, H. S., and El-Sharkawi, M. E. 2001. Effect of shaping characteristics on the performance of nested transactions. Information and Software Technology 43(10): 579-590.

    Google Scholar 

  • Fekete, A., Lynch, N., Merrit, M., and Whiel, W. E. 1987. Nested transactions and read/write locking. In Proceedings of the International ACM Symposium on Principles of Database Systems. San Diego, CA, pp. 97-111.

  • Fekete, A., Lynch, N., and Weihl, W. E. 1990. A serialization graph construction for nested transactions. In Proceedings of the International ACM Symposium on Principle of Database Systems, pp. 94-108.

  • Fishwick, P. A. 1992. SIMPACK: C-Based Simulation Tool Package Version 2. University of Florida.

  • Gray, J., and Reuter, A. 1994. Transaction Processing: Concepts and Techniques. San Francisco: Morgan Kaufmann Press.

    Google Scholar 

  • Harder, T., and Rothermel, K. 1993. Concurrency control issue in nested transactions. VLDB Journal 2(1): 39-74.

    Google Scholar 

  • Haritsa, J. R., Livny, M., and Carey, M. J. 1991. Earliest deadline scheduling for real-time database systems. In Proceedings of the International IEEE Symppsoim on Real-Time System. pp. 232-242.

  • Haritsa, J. R., Carey, M. J., and Livny, M. 1993. Value-based scheduling in real-time database systems. VLDB Journal 2(2): 117-152.

    Google Scholar 

  • Haritsa, J. R., Ramamritham, K., and Gupta, R. 2000. The PROMPT real-time commit protocol. IEEE Transactions on Parallel and Distributed Systems 11(2): 160-181.

    Google Scholar 

  • white_paper.pdf.

  • Hong, D., Johnson, T., and Chankararthy, S. 1993. Real-time transaction: a cost conscious approach. In Proceedings of the International ACM Conference on Management of Data. Washington, DC, pp. 197-206.

  • Huang, J., and Stankovic, J. 1990. Real-Time Buffer Management. COINS TR 90-65.

  • Jain, R. 1991. The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. New York: Wiley.

    Google Scholar 

  • Kao, B., and Garcia-Molina, H. 1997. Deadline assignment in a distributed soft real-time system. IEEE Transactions on Parallel and Distributed Systems 8(12): 1268-1274.

    Google Scholar 

  • Lam, K. Y., Chan, E., Kuo, T. W., Ng, S. W., and Hung, D. 2001. RETINA: a real-time traffic navigation system. ACM SIGMOD Record 30(2): 615.

    Google Scholar 

  • Lee, J. K., and Fekete, A. 1991. Multi-granularity locking for nested transaction systems. Lecture notes in Computer Science 495: 160-172.

    Google Scholar 

  • Lee, V. C. S., Lam, K. Y., and Hung, S. L. 1996. Impact of high speed network on performance of real-time concurrency control protocol. Journal of Systems Architecture 42(6–7): 531-546.

    Google Scholar 

  • Lee, V. C. S., Lam, K. Y., and Kao, B. 1998. Priority scheduling of transactions in distributed real-time databases. Real-time Systems 15(1): 31-61.

    Google Scholar 

  • Madria, S. K. 1997. A study of the concurrency control and recovery algorithms in nested transaction environment. The Computer Journal 40(10): 630-639.

    Google Scholar 

  • Madria, S. K., Maheshwari, S. N., Chandra, B., and Bhargava, B. 2000. An open and safe nested transaction model: concurrency control and recovery. Journal of Systems and Software 55(2): 151-165.

    Google Scholar 

  • Moss, J. E. B. 1985. Nested transactions: an approach to reliable distributed computing. Ph.D. Thesis, MIT Press.

  • Mueller, E. T., Moore, J. D., and Pepek, G. J. 1983. A nested transaction mechanism for LOCUS. In Proceedings of the International ACM Symposium on Operating Systems Principle. Bretton Woods, NH, pp. 71-89.

  • Passmark Software. 2002. PerformanceTest V4.0. http://www.passmark.com, dated on September 1, 2002.

  • Robertazzi, T. G. 2000. Computer Networks and Systems: Queuing Theory and Performance Evaluation, 3rd Edn. New York: Springer-Verlag.

    Google Scholar 

  • Sha, L., Rajkumar, R., and Lehooczky, J. P. 1988. Concurrency control for distributed real-time databases. ACM SIGMOD Record 17(1): 82-98.

    Google Scholar 

  • Tseng, S. M. 1997. Design and analysis of value-base scheduling policies for real-time database systems. Ph.D. Thesis, National Chiao Tung University, Taiwan.

    Google Scholar 

  • Ulusoy, Ö. 1994. Processing real-time transactions in a replicated database system. Distributed and Parallel Databases 2(2): 405-436.

    Google Scholar 

  • Ulusoy, Ö., and Belford, G. G. 1993. Real-time transaction scheduling in database system. Information Systems 18(8): 559-580.

    Google Scholar 

  • Weihl, W. E. 1988. Commutativity-based concurrency control for abstract data types. IEEE Transactions on Computer (37): 1488-1505.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, HR., Chin, Y.H. Scheduling Value-Based Nested Transactions in Distributed Real-Time Database Systems. Real-Time Systems 27, 237–269 (2004). https://doi.org/10.1023/B:TIME.0000029050.47538.25

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:TIME.0000029050.47538.25

Navigation