Skip to main content
SpringerLink
Log in

Concurrency Admission Control for RT Databases

  • Chapter
Real-Time Database and Information Systems: Research Advances

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 420))

Abstract

The main challenge involved in scheduling transactions in a Real-Time Database (RTDB) system is that the resources needed to execute a transaction are not known a priori. For example, the set of objects to be read (written) by a transaction may be dependent on user input (e.g. in a stock market application) or dependent on sensory inputs (e.g. in a process control application). Therefore, the a priori reservation of resources (e.g. read/write locks on data objects) to guarantee a particular Worst Case Execution Time (WCET) becomes impossible—and the non-deterministic delays associated with the on-the-fly acquisition of such resources pose the real challenge of integrating scheduling and concurrency control techniques.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Robert Abbott and Hector Garcia-Molina. Scheduling real-time transactions: A performance evaluation. In Proceedings of the 14th International Conference on Very Large Data Bases, pages 1–12, Los Angeles, Ca, 1988.

    Google Scholar 

  2. N. Audsley, A. Burns, M. Richardson, and A. Wellings. A database model for hard real-time systems. Technical report, Real-Time Systems Group, University of York„ U.K., 1991.

    Google Scholar 

  3. N. C. Audsley, R. I. Davis, and A. Burns. Mechanisms for enhancing the flexibility and utility of hard real-time systems. In Proceedings of the Real-Time Systems Symposium, pages 12–21, December 1994.

    Google Scholar 

  4. B. R. Badrinath and Krithi Ramamritham, Semantics-based concurrency control: Beyond commutativity. ACM Transactions on Database Systems, 17(1):163–199, March 1992.

    Article  Google Scholar 

  5. Azer Bestavros and Spyridon Braoudakis. Timeliness via speculation for real-time databases. In Proceedings of RTSS’94: The 14 th IEEE Real-Time System Symposium, San Juan, Puerto Rico, December 1994.

    Google Scholar 

  6. Azer Bestavros and Spyridon Braoudakis. Value-cognizant speculative concurrency control. In Proceedings of VLDB’95: The International Conference on Very Large Databases, Zurich, Switzerland, Spetember 1995.

    Google Scholar 

  7. Azer Bestavros and Sue Nagy. Value-cognizant admission control for rtdb systems. In RTSS’96: The 17th Real-Time Systems Symposium, pages 230–239, Washington, D.C., December 1996.

    Chapter  Google Scholar 

  8. Sara Biyabani, John Stankovic, and Krithi Ramamritham. The integration of deadline and criticalness in hard real-time scheduling. In Proceedings of the 9th Real-Time Systems Symposium, December 1988.

    Google Scholar 

  9. G. Buttazzo, M. Spuri, and F. Sensini. Value vs. deadline scheduling in overload conditions. In Proceedings of the 16th Real-Time Systems Symposium, December 1995.

    Google Scholar 

  10. H. Chetto and M. Chetto. Some results of the earliest deadline scheduling algorithm. IEEE Transactions on Software Engineering, 15(10):1261–1269, October 1989.

    Article  MathSciNet  Google Scholar 

  11. R. I. Davis, S. Punnekkat, N. Audsley, and A. Burns. Flexible scheduling for adaptable real-time systems. In Proceedings of the Real-Time Technology and Applications Symposium, pages 230–239, May 1995.

    Google Scholar 

  12. M. L. Dertouzos. Control robotics: The procedural control of physical processes. In Proceedings IFIP Congress, pages 807–813, 1974.

    Google Scholar 

  13. K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. The notions of consistency and predicate locks in a database system. Communications of the ACM, 19(11):624–633, November 1976.

    Article  MathSciNet  MATH  Google Scholar 

  14. B. Goyal, J. Haritsa, S. Seshadri, and V. Srinivasan. Index concurrency control in firm real-time dbms. In Proceedings of the 21st VLDB Conference, pages 146–157, September 1995.

    Google Scholar 

  15. T. Haerder. Observations on optimistic concurrency control schemes. Information Systems, 9(2):111–120, October 1984.

    Article  Google Scholar 

  16. Jayant R. Haritsa, Miron Livny, and Michael J. Carey. Earliest deadline scheduling for real-time database systems. In Proceedings of the 12th Real-Time Systems Symposium, December 1991.

    Google Scholar 

  17. J. Huang, J. A. Stankovic, D. Towsley, and K. Ramamritham. Experimental evaluation of real-time transaction processing. In Proceedings of the 10th Real-Time Systems Symposium, December 1989.

    Google Scholar 

  18. E. Jensen, C. Locke, and H. Tokuda. A time-driven scheduling model for real-time operating systems. In Proceedings of the 6th Real-Time Systems Symposium, pages 112–122, December 1985.

    Google Scholar 

  19. C. M. Krishna and K. G. Shin. On scheduling tasks with a quick recovery from failure. IEEE Transactions on Computers,35(5):448–455, May 1986.

    Article  MATH  Google Scholar 

  20. H. Kung and John Robinson. On optimistic methods for concurrency control. ACM Transactions on Database Systems, 6(2), June 1981.

    Google Scholar 

  21. A. Liestman and R. Campbell. A fault-tolerant scheduling problem. IEEE Transaction on Software Engineering, SE-12(11):1089–1095, November 1986.

    Article  MATH  Google Scholar 

  22. C. L. Liu and J. Layland. Scheduling algorithms for multiprogramming in hard real-time environments. Journal of the Assocation of Computing Machinery, 20(1):46–61, January 1973.

    Article  MathSciNet  MATH  Google Scholar 

  23. J. W.-S. Liu, K. J. Lin, and S. Natarajan. Scheduling real-time, periodic jobs using imprecise results. In Proceedings of the 8th IEEE Real-time Systems Symposium, December 1987.

    Google Scholar 

  24. C. Locke. Best Effort Decision Making for Real-Time Scheduling. PhD thesis, Carnegie-Mellon University, Department of Computer Science, May 1986.

    Google Scholar 

  25. D. Menasce and T. Nakanishi. Optimistic versus pessimistic concurrency control mechanisms in database management systems. Information Systems, 7(1) ,1982.

    Google Scholar 

  26. Sue Nagy and Azer Bestavros. Admission control for soft-deadline transactions in accord. In 3rd IEEE Real-time Technology and Applications Symposium, pages 160–165, Montreal, Canada, June 1997.

    Chapter  Google Scholar 

  27. H. Pang, M. J. Carey, and M. Livny. Managing memory for real-time queries. In Proceedings of the 1994 ACM SIGMOD Conference on Management of Data, pages 221–232, 1994.

    Chapter  Google Scholar 

  28. John Robinson. Design of Concurrency Controls for Transaction Processing Systems. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, 1982.

    Google Scholar 

  29. M. Squadrito, B. Thuraisingham, L. DiPippo, and V. Wolfe. Towards priority ceilings in object-based semantic real-time concurrency control. In Proceedings of RTDB’96: The 1996 Workshop on Real-Time Databases, pages 127–134, Newport Beach, California, March 1996.

    Google Scholar 

  30. John Stankovic and Wei Zhao. On real-time transactions. ACM, SIGMOD Record, 17(1):4–18, 1988.

    Article  Google Scholar 

  31. Ken Tew, Panos K. Chrysanthis, and Daniel Mosse. Emperical evaluation of task and resource scheduling in dynamic real-time systems. In Proceedings of RTSS’96 WIP Session: The 17 th IEEE Real-Time System Symposium, pages 35–38, Washington, D.C., December 1996.

    Google Scholar 

  32. Robert H. Thomas. A majority consensus approach to concurrency control for multiple copy databases. ACM Transactions on Database Systems, 4(2):180–209, 1979.

    Article  Google Scholar 

  33. S.-M. Tseng, Y.H. Chin, and W.-P. Yang. Scheduling real-time transactions with dynamic values: a performance evaluation. In Proceedings Second International Workshop on Real-Time Computing Systems and Applications, pages 60–67, October 1995.

    Chapter  Google Scholar 

  34. W. Weihl. Commutativity-based concurrency control for abstract data types. IEEE Transactions on Computers, 37(12):1488–1505, 1988.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Open Group, Research Institute, Cambridge, MA, 02142, USA

    Sue Nagy

  2. Computer Science Department, Boston University, Boston, MA, 02215, USA

    Azer Bestavros

Authors
  1. Sue Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Azer Bestavros
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Boston University, Boston, Massachusetts, USA

    Azer Bestavros

  2. University of Rhode Island, Kingston, Rhode Island, USA

    Victor Fay-Wolfe

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Nagy, S., Bestavros, A. (1997). Concurrency Admission Control for RT Databases. In: Bestavros, A., Fay-Wolfe, V. (eds) Real-Time Database and Information Systems: Research Advances. The Springer International Series in Engineering and Computer Science, vol 420. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6069-2_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-6069-2_15

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7780-1

  • Online ISBN: 978-1-4615-6069-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation