Skip to main content

A Compositional Framework for Real-Time Guarantees

  • Conference paper
  • 612 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4147))

Abstract

Our primary goal is to develop a compositional real-time scheduling framework where global (system-level) timing properties are established by composing together independently (specified and) analyzed local (component-level) timing properties. In this paper, we define two problems and one design issue in developing such a framework and present our approaches to the problems and the design issue. The two problems are (1) the scheduling interface derivation problem that is to (exactly) abstract the collective real-time requirements of a component as a single real-time requirement, or a scheduling interface and (2) the scheduling interface composition problem that is to (exactly) compose the scheduling interfaces of components into the system-level scheduling interface. The design issue is how to define a scheduling interface model. Our approach is to use the standard periodic model as the scheduling interface model and to address the two problems with the periodic model. We introduce exact conditions under which our proposed periodic scheduling interface model can abstract the collective real-time requirements that a set of periodic tasks demands under EDF (earliest deadline first) and RM (rate monotonic) scheduling. We present simulation results to evaluate the overheads that the periodic scheduling interfaces incur in terms of utilization increase.

This research was supported in part by NSF CCR-9988409, NSF CCR-0086147, NSF CCR-0209024, ARO DAAD19-01-1-0473, and ETRI.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proc. of IEEE Real-Time Systems Symposium, December 1990, pp. 182–190 (1990)

    Google Scholar 

  2. Bernat, G., Burns, A., Llamosi, A.: Weakly hard real-time systems. IEEE Transactions on Computers 50(4), 308–321 (2001)

    Article  MathSciNet  Google Scholar 

  3. Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 117–133. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Deng, Z., Liu, J.W.-S.: Scheduling real-time applications in an open environment. In: Proc. of IEEE Real-Time Systems Symposium, December 1997, pp. 308–319 (1997)

    Google Scholar 

  5. Feng, X., Mok, A.: A model of hierarchical real-time virtual resources. In: Proc. of IEEE Real-Time Systems Symposium, December 2002, pp. 26–35 (2002)

    Google Scholar 

  6. Hamdaoui, M., Ramanathan, P.: A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transactions on Computers 44(12), 1443–1451 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kuo, T.-W., Li, C.H.: A fixed-priority-driven open environment for real-time applications. In: Proc. of IEEE Real-Time Systems Symposium, December 1999, pp. 256–267 (1999)

    Google Scholar 

  8. Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proc. of IEEE Real-Time Systems Symposium, pp. 166–171 (1989)

    Google Scholar 

  9. Lipari, G., Baruah, S.: A hierarchical extension to the constant bandwidth server framework. In: Proc. of IEEE Real-Time Technology and Applications Symposium, May 2001, pp. 26–35 (2001)

    Google Scholar 

  10. Lipari, G., Bini, E.: Resource partitioning among real-time applications. In: Proc. of Euromicro Conference on Real-Time Systems (July 2003)

    Google Scholar 

  11. Liu, C.L., Layland, J.W.: Scheduling algorithms for multi-programming in a hard-real-time environment. Journal of the ACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  12. Parekh, A.K., Gallagher, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking 1(3), 344–357 (1993)

    Article  Google Scholar 

  13. Regehr, J., Stankovic, J.: HLS: A framework for composing soft real-time schedulers. In: Proc. of IEEE Real-Time Systems Symposium, December 2001, pp. 3–14 (2001)

    Google Scholar 

  14. Saewong, S., Rajkumar, R., Lehoczky, J.P., Klein, M.H.: Analysis of hierarchical fixed-priority scheduling. In: Proc. of Euromicro Conference on Real-Time Systems (June 2002)

    Google Scholar 

  15. Shin, I., Lee, I.: Periodic resource model for compositional real-time guarantees. In: Proc. of IEEE Real-Time Systems Symposium, December 2003, pp. 2–13 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shin, I., Lee, I. (2006). A Compositional Framework for Real-Time Guarantees. In: Broy, M., Krüger, I.H., Meisinger, M. (eds) Automotive Software – Connected Services in Mobile Networks. ASWSD 2004. Lecture Notes in Computer Science, vol 4147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11823063_4

Download citation

  • DOI: https://doi.org/10.1007/11823063_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37677-4

  • Online ISBN: 978-3-540-37678-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics