Predictably Flexible Real-Time Scheduling

Chapter

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.

Keywords

Spare Capacity Schedulability Test Precedence Graph Flexibility Analysis Target Window 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

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.

References

  1. 1.
    Abdelzaher TF, Shin KG (1999) Combined task and message scheduling in distributed real-time systems. IEEE Trans Parallel Distributed SystGoogle Scholar
  2. 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–353Google Scholar
  3. 3.
    Burns A (2004) Programming real-time systems. In: ECRTS 04–16th euromicro conference on real-time systems, Catania, SicilyGoogle Scholar
  4. 4.
    Chetto M, Chetto H (1989) Scheduling periodic and sporadic tasks in a real-time system. Inf Proc LettGoogle Scholar
  5. 5.
    Fohler G (1994) Flexibility in statically scheduled hard real-time systems. PhD thesis, Technische Universität Wien, Austria, April 1994Google Scholar
  6. 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, ItalyGoogle Scholar
  7. 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 1997Google Scholar
  8. 8.
    Garey MR, Johnson DS, Simons BB, Tarjan RE (1981) Scheduling unit-time tasks with arbitrary release times and deadlines. IEEE Trans Soft EngGoogle Scholar
  9. 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 1992Google Scholar
  10. 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 1998Google Scholar
  11. 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 1999Google Scholar
  12. 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 2000Google Scholar
  13. 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. 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–165Google Scholar
  15. 15.
    Kopetz H (2011) Real-time systems – design principles for distributed embedded applications. Springer, BerlinMATHGoogle Scholar
  16. 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 1993Google Scholar
  17. 17.
    Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in hard real-time environment. J ACM 20:1MathSciNetCrossRefGoogle Scholar
  18. 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. 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 2002Google Scholar
  20. 20.
    Šůcha P, Hanzálek Z (2004) Scheduling with start time realated deadlines. In: IEEE international symposium on computer aided control systems designGoogle Scholar
  21. 21.
    Yodaiken V (1998) Rough notes on priority inheritance. Technical report, New Mexico Institut of Mining, 1998Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.University of KaiserslauternKaiserslauternGermany

Personalised recommendations