Skip to main content

Supporting Deadlines and EDF Scheduling in Ada

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3063))

Abstract

Scheduling policies are of crucial importance to real-time systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support another common paradigm, Earliest Deadline First (EDF). A proposal is described that uses standard priorities and the priority ceiling protocol for protected objects.

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. Baker, T.P.: Stack-based scheduling of realtime processes. Real-Time Systems 3(1) (March 1991)

    Google Scholar 

  2. Bernat, G., Burns, A.: Combining (n m)-hard deadlines with dual priority scheduling. In: Proceedings of 18th IEEE Real-Time systems symposium, San Francisco, CA (December 1997)

    Google Scholar 

  3. Burns, A., Dobbing, B., Vardanega, T.: Guide for the use of the Ada Ravenscar Profile in high integrity systems. Technical Report YCS-2003-348, University of York, Department of Computer Science (2003)

    Google Scholar 

  4. Burns, A., González Harbour, M., Wellings, A.J.: A round robin scheduling policy for Ada. In: Rosen, J.-P., Strohmeier, A. (eds.) Ada-Europe 2003. LNCS, vol. 2655, pp. 334–343. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Burns, A., Wellings, A.J.: Real-Time Systems and Programming Languages, 3rd edn. Addison-Wesley Longman, Amsterdam (2001)

    Google Scholar 

  6. Burns, A., Wellings, A.J.: Dual priority scheduling in ada 95 and real-time posix. In: Proceedings of the 21st IFAC/IFIP Workshop on Real-Time Programming, WRTP 1996, pp. 45–50 (1996)

    Google Scholar 

  7. Davis, R.I., Wellings, A.J.: Dual priority scheduling. In: Proceedings Real-Time Systems Symposium, pp. 100–109 (1995)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Palencia, J.C., González Harbour, M.: Response time analysis for tasks scheduled under edf within fixed priorities. In: Proceedings of the 24th IEEE Real-Time Systems Simposium, Cancun, Mxico, pp. 200–209 (2003)

    Google Scholar 

  10. Aldea Rivas, M., González Harbour, M.: Application-defined scheduling in Ada. In: Tokar, J.L. (ed.) Proceedings of the 11th International Real-Time Ada Workshop. ACM Ada Letters, pp. 77–84 (2002)

    Google Scholar 

  11. Spuri, M.: Analysis of deadline scheduled real-time systems. Technical Report RR-2772, INRIA (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burns, A., Wellings, A.J., Taft, S.T. (2004). Supporting Deadlines and EDF Scheduling in Ada. In: Llamosí, A., Strohmeier, A. (eds) Reliable Software Technologies - Ada-Europe 2004. Ada-Europe 2004. Lecture Notes in Computer Science, vol 3063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24841-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24841-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-24841-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics