Skip to main content
SpringerLink
Log in
Book cover

Advances in Real-Time Systems pp 207–221Cite as

Predictably Flexible Real-Time Scheduling

  • Chapter
  • First Online:

  • 1266 Accesses

Abstract

Historically, real-time systems have been focussed on providing single, specific solutions to single, specific applications, treating all activities with the same methods, geared towards the most demanding scenarios. While the high cost of such an approach is acceptable for applications with dramatic failure consequences it is no longer justified in a growing number of new applications. In these, real-time behavior is demanded only for parts of the systems, few faults can be tolerated. Instead of strict real-time behavior for the entire system, these applications demand “also real-time”, or some temporal control.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.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

Learn about institutional subscriptions

Notes

  1. 1.

    A number of terms have been used to describe scheduling methods which construct scheduling tables offline, such as initially static, pre-runtime, offline scheduling. The term table driven appears the most general.

  2. 2.

    Then, the task properties, “priority” are separated from the importance of a task, “deadline” from the timing constraint. Rather, they both serve only to direct the online scheduling algorithm to execute the proper rules for schedulability.

  3. 3.

    We apply the same mechanisms to the network as well, i.e., shifting messages, as detailed in [6].

References

  1. Abdelzaher TF, Shin KG (1999) Combined task and message scheduling in distributed real-time systems. IEEE Trans Parallel Distributed Syst

    Google Scholar 

  2. Björn B. Brandenburg, John M. Calandrino, Aaron Block, Hennadiy Leontyev, James H. Anderson (2008) Real-time synchronization on multiprocessors: To block or not to block, to suspend or spin? In: IEEE real-time and embedded technology and applications symposium, pp 342–353

    Google Scholar 

  3. Burns A (2004) Programming real-time systems. In: ECRTS 04–16th euromicro conference on real-time systems, Catania, Sicily

    Google Scholar 

  4. Chetto M, Chetto H (1989) Scheduling periodic and sporadic tasks in a real-time system. Inf Proc Lett

    Google Scholar 

  5. Fohler G (1994) Flexibility in statically scheduled hard real-time systems. PhD thesis, Technische Universität Wien, Austria, April 1994

    Google Scholar 

  6. Fohler G (1995) Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems. In: Proceedings of the 16th real-time systems ymposium, Pisa, Italy

    Google Scholar 

  7. Fohler G, Ramamritham K (1997) Static scheduling of pipelined periodic tasks in distributed real-time systems. In: Proceedings of the 8th euromicro workshop on real-time systems, June 1997

    Google Scholar 

  8. Garey MR, Johnson DS, Simons BB, Tarjan RE (1981) Scheduling unit-time tasks with arbitrary release times and deadlines. IEEE Trans Soft Eng

    Google Scholar 

  9. Hou C-J, Shin KG (1992) Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. In: IEEE Proceedings of the 13th IEEE real-time systems symposium, pp 146–155, December 1992

    Google Scholar 

  10. Isovic D, Fohler G (1998) Handling sporadic tasks in off-line scheduled distributed hard real-time systems. In: Proceedings of the 10th euromicro onference on real-time systems, York, UK, June 1998

    Google Scholar 

  11. Isovic D, Fohler G (1999) Handling sporadic tasks in statically scheduled distributed real-time systems. In: Proceedings of the 10th euromicro conference on real-time systems, June 1999

    Google Scholar 

  12. Isovic D, Fohler G (2000) Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints. In: Proceedings of the 21st IEEE real-time systems symposium, Walt Disney World, Orlando, FL, November 2000

    Google Scholar 

  13. Isovic D, Fohler G (2009) Handling mixed sets of tasks in combined offline and online scheduled real-time systems. Real-Time Syst J 43(3)

    Google Scholar 

  14. Jonsson J, Shin KG (1997) A parametrized branch-and-bound strategy for scheduling precedence-constrained tasks on a multiprocessor system. In: ICPP, pp 158–165

    Google Scholar 

  15. Kopetz H (2011) Real-time systems – design principles for distributed embedded applications. Springer, Berlin

    MATH  Google Scholar 

  16. Kopetz H, Fohler G, Grünsteidl G, Kantz H, Pospischil G, Puschner P, Reisinger J, Schlatterbeck R, Schütz W, Vrchoticky A, Zainlinger R (1993) Real-time system development: The programming model of mars. In: Proceedings of the international symposium on autonomous decentralized systems, Kawasaki, Japan, March/April 1993

    Google Scholar 

  17. Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in hard real-time environment. J ACM 20:1

    Article  MathSciNet  MATH  Google Scholar 

  18. Ramamritham K, Stankovic JA, Shiah P (1990) Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Trans Parallel Distributed Syst 2(1)

    Google Scholar 

  19. Verissimo P (2002) Fundamental questions in the et vs. tt debate? please look elsewhere. In: Next-TTA workshop on ET-TT integration, Grenoble, France, October 2002

    Google Scholar 

  20. Šůcha P, Hanzálek Z (2004) Scheduling with start time realated deadlines. In: IEEE international symposium on computer aided control systems design

    Google Scholar 

  21. Yodaiken V (1998) Rough notes on priority inheritance. Technical report, New Mexico Institut of Mining, 1998

    Google Scholar 

Download references

Acknowledgements

The author wishes to thank the members of the research groups at TU Vienna, Austria, University of Massachusetts at Amherst, USA, MDH, Sweden, and TU Kaiserslautern, Germany for their valuable contributions and discussions of the line of research. Special thanks go to Damir Isovic for advancing the state of slot shifting and the many inspiration discussions.

Author information

Authors and Affiliations

  1. University of Kaiserslautern, Kaiserslautern, Germany

    Gerhard Fohler

Authors
  1. Gerhard Fohler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gerhard Fohler .

Editor information

Editors and Affiliations

  1. LS für Realzeit-Computersysteme, TU München, Arcisstraße 21, München, 80290, Germany

    Samarjit Chakraborty

  2. LS Kommunikationsnetze, TU München, Arcisstr. 21, München, 80290, Germany

    Jörg Eberspächer

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fohler, G. (2012). Predictably Flexible Real-Time Scheduling. In: Chakraborty, S., Eberspächer, J. (eds) Advances in Real-Time Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24349-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24349-3_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24348-6

  • Online ISBN: 978-3-642-24349-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation