Skip to main content
SpringerLink
Log in

Deadline-Aware Programming and Scheduling

  • Conference paper
Reliable Software Technologies – Ada-Europe 2014 (Ada-Europe 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8454))

Included in the following conference series:

Abstract

Deadlines are the most important events in real-time systems. Real-time programs must therefore be aware of deadlines, and be able to identify and react to missed deadlines. Moreover, Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In this paper we explore how a resource sharing protocol (called the DFP – Deadline Floor inheritance Protocol), which has been proposed for languages such as Ada, can be incorporated into the language’s definition. We also address the programming of systems that have mixed scheduling (e.g. fixed priority and EDF). The incorporation of the DFP into Ada requires some changes to the current predefined packages. These changes are also of use in supporting the programming of deadline-aware systems even when not scheduling by EDF.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldea, M., Burns, A., Gutiérrez, M., Harbour, M.G.: Incorporating the deadline floor protocol in Ada. ACM SIGAda Ada Letters – Proc. of IRTAW 16 XXXIII(2), 49–58 (2013)

    Article  Google Scholar 

  2. Baker, T.: A stack-based resource allocation policy for realtime processes. In: Proc. IEEE Real-Time Systems Symposium (RTSS), pp. 191–200 (1990)

    Google Scholar 

  3. Baker, T.: Stack-based scheduling of realtime processes. Journal of Real-Time Systems 3(1) (March 1991)

    Google Scholar 

  4. Block, A., Leontyev, H., Brandenburg, B.B., Anderson, J.H.: A flexible real-time locking protocol for multiprocessors. In: 13th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2007, pp. 47–56. IEEE Computer Society (2007)

    Google Scholar 

  5. Brandenburg, B., Anderson, J.: Optimality results for multiprocessor real-time locking. In: Real-Time Systems Symposium (RTSS), pp. 49–60 (2010)

    Google Scholar 

  6. Brandenburg, B., Anderson, J.: Real-time resource sharing under cluster scheduling. In: Proc. EMSOFT. ACM Press (2011)

    Google Scholar 

  7. Burns, A.: A Deadline-Floor Inheritance Protocol for EDF Scheduled Real-Time Systems with Resource Sharing. Technical Report YCS-2012-476, Department of Computer Science, University of York, UK (2012)

    Google Scholar 

  8. Burns, A., Dobbing, B., Romanski, G.: The Ravenscar tasking profile for high integrity real-time programs. In: Asplund, L. (ed.) Ada-Europe 1998. LNCS, vol. 1411, pp. 263–275. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Burns, A., Gutiérrez, M., Aldea, M., Harbour, M.G.: A Deadline-Floor Inheritance Protocol for EDF Scheduled Embedded Real-Time Systems with Resource Sharing. IEEE Transaction on Computers (available online, 2014)

    Google Scholar 

  10. Burns, A., Wellings, A.: A schedulability compatible multiprocessor resource sharing protocol - MrsP. In: Proceedings of ECRTS, pp. 282–291 (2013)

    Google Scholar 

  11. Burns, A., Wellings, A.J., Taft, S.T.: Supporting deadlines and EDF scheduling in ada. In: Llamosí, A., Strohmeier, A. (eds.) Ada-Europe 2004. LNCS, vol. 3063, pp. 156–165. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Burns, A., Wellings, A.J.: Real-Time Systems and Programming Languages, 4th edn. Addison Wesley Longman (2009)

    Google Scholar 

  13. Davis, R., Burns, A.: A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys 43(4), 35:1 –35:44 (2011)

    Google Scholar 

  14. Faggioli, D., Lipari, G., Cucinotta, T.: The multiprocessor bandwidth inheritance protocol. In: Proc. of the 22nd Euromicro Conference on Real-Time Systems (ECRTS), pp. 90–99 (2010)

    Google Scholar 

  15. Fairbairn, M.L., Burns, A.: Implementing and verifying EDF preemption-level resource control. In: Brorsson, M., Pinho, L.M. (eds.) Ada-Europe 2012. LNCS, vol. 7308, pp. 193–206. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Gai, P., Lipari, G., Di Natale, M.: Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In: Proc. 22nd RTSS, pp. 73–83 (2001)

    Google Scholar 

  17. Lin, S., Burns, A., Wellings, A.: Supporting lock-based multiprocessor resource sharing protocols in real-time programming languages. Concurrency and Computation: Practice and Experience (2012)

    Google Scholar 

  18. Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard real-time environment. JACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  19. Sha, L., Rajkumar, R., Lehoczky, J.: Priority inheritance protocols: An approach to real-time synchronisation. IEEE Transactions on Computers 39(9), 1175–1185 (1990)

    Article  MathSciNet  Google Scholar 

  20. Taft, S.T., Duff, R.A., Brukardt, R.L., Ploedereder, E., Leroy, P.: Ada 2005 Reference Manual. LNCS, vol. 4348. Springer, Heidelberg (2006)

    Google Scholar 

  21. Taft, S.T., Duff, R.A., Brukardt, R.L., Ploedereder, E., Leroy, P., Schonberg, E.: Ada 2012 Reference Manual. LNCS, vol. 8339. Springer, Heidelberg (2012)

    Google Scholar 

  22. Wellings, A.: Session summary: Locking protocols. ACM SIGAda Ada Letters, Proc. of IRTAW 16 XXXIII(2), 123–125 (2013)

    Google Scholar 

  23. Wellings, A.J., Burns, A.: Real-time utilities for Ada 2005. In: Abdennadher, N., Kordon, F. (eds.) Ada-Europe 2007. LNCS, vol. 4498, pp. 1–14. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Zerzelidis, A., Burns, A., Wellings, A.: Correcting the EDF protocol in Ada 2005. Proc. of IRTAW 13, Ada Letters XXVII(2), 18–22 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, UK

    Alan Burns & Andy Wellings

Authors
  1. Alan Burns
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andy Wellings
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Paris-Est, Marne-la-Vallée, France

    Laurent George

  2. Department of Mathematics, University of Padua, via Trieste, 63, 35121, Padua, Italy

    Tullio Vardanega

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Burns, A., Wellings, A. (2014). Deadline-Aware Programming and Scheduling. In: George, L., Vardanega, T. (eds) Reliable Software Technologies – Ada-Europe 2014. Ada-Europe 2014. Lecture Notes in Computer Science, vol 8454. Springer, Cham. https://doi.org/10.1007/978-3-319-08311-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08311-7_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08310-0

  • Online ISBN: 978-3-319-08311-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation