Advertisement

Real-Time Systems

, Volume 44, Issue 1–3, pp 26–71 | Cite as

Generalized tardiness bounds for global multiprocessor scheduling

  • Hennadiy LeontyevEmail author
  • James H. Anderson
Article

Abstract

We consider the issue of deadline tardiness under global multiprocessor scheduling algorithms. We present a general tardiness-bound derivation that is applicable to a wide variety of such algorithms (including some whose tardiness behavior has not been analyzed before). Our derivation is very general: job priorities may change rather arbitrarily at runtime, capacity restrictions may exist on certain processors, and, under certain conditions, non-preemptive regions are allowed. Our results show that, with the exception of static-priority algorithms, most global algorithms considered previously have bounded tardiness. In addition, our results provide a simple means for checking whether tardiness is bounded under newly-developed algorithms.

Keywords

Scheduling Soft real-time Multiprocessors 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anderson J, Srinivasan A (2004) Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. J Comput Syst Sci 68(1):157–204 zbMATHCrossRefMathSciNetGoogle Scholar
  2. Bisson S (2006) Azul announces 192 core Java appliance. http://www.itpro.co.uk/servers/news/99765/azul-announces-192-core-java-appliance.html
  3. Block A, Leontyev H, Brandenburg B, Anderson J (2007) A flexible real-time locking protocol for multiprocessors. In: Proceedings of the 13th IEEE international conference on embedded and real-time computing systems and applications, pp 71–80 Google Scholar
  4. Brandenburg B, Anderson J (2007) Integrating hard/soft real-time tasks and best-effort jobs on multiprocessors. In: Proceedings of the 19th Euromicro conference on real-time systems, pp 61–70 Google Scholar
  5. Calandrino J, Anderson J (2008) Cache-aware real-time scheduling on multicore platforms: Heuristics and a case study. In: Proceedings of the 20th Euromicro conference on real-time systems, pp 209–308 Google Scholar
  6. Chakraborty S, Kunzli S, Thiele L (2003) A general framework for analysing system properties in platform-based embedded system designs. In: Proceedings of the conference on design, automation and test in Europe, vol 1 Google Scholar
  7. Chetto H, Chetto M (1989) Some results of the earliest deadline scheduling algorithm. IEEE Trans Softw Eng 15(10):1261–1269 CrossRefMathSciNetGoogle Scholar
  8. Devi U (2006) Soft real-time scheduling on multiprocessors. PhD thesis, University of North Carolina, Chapel Hill, NC Google Scholar
  9. Devi U, Anderson J (2004) Improved conditions for bounded tardiness under EPDF fair multiprocessor scheduling. In: Proceedings of 12th international workshop on parallel and distributed real-time systems Google Scholar
  10. Devi U, Anderson J (2005) Tardiness bounds for global EDF scheduling on a multiprocessor. In: Proceedings of the 26th IEEE real-time systems symposium, pp 330–341 Google Scholar
  11. Devi U, Anderson J (2006) Flexible tardiness bounds for sporadic real-time task systems on multiprocessors. In: Proceedings of the 20th IEEE international parallel and distributed processing symposium on CDROM Google Scholar
  12. Devi U, Anderson J (2008) Tardiness bounds for global EDF scheduling on a multiprocessor. Real-Time Syst 38(2):133–189 zbMATHCrossRefGoogle Scholar
  13. Devi U, Leontyev H, Anderson J (2006) Efficient synchronization under global EDF scheduling on multiprocessors. In: Proceedings of the 18th Euromicro conference on real-time systems, pp 75–84 Google Scholar
  14. Farivar C (2006) Intel developers forum roundup: four cores now, 80 cores later. http://www.engadget.com/2006/09/26/intel-developers-forum-roundup-four-cores-now-80-cores-later/
  15. Jeffay K, Stone D (1993) Accounting for interrupt handling costs in dynamic priority task systems. In: Proceedings of the 14th IEEE symposium on real-time systems, pp 212–221 Google Scholar
  16. Leontyev H, Anderson J (2007a) Generalized tardiness bounds for global multiprocessor scheduling. In: Proceedings of the 28th IEEE real-time systems symposium, pp 413–422 Google Scholar
  17. Leontyev H, Anderson J (2007b) Tardiness bounds for EDF scheduling on multi-speed multicore platforms. In: Proceedings of the 13th IEEE international conference on embedded and real-time computing systems and applications, pp 103–111 Google Scholar
  18. Leontyev H, Anderson J (2007c) Tardiness bounds for FIFO scheduling on multiprocessors. In: Proceedings of the 19th Euromicro conference on real-time systems, pp 71–80 Google Scholar
  19. Leontyev H, Anderson J (2008) A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees. In: Proceedings of the 20th Euromicro conference on real-time systems, pp 191–200 Google Scholar
  20. Liu J (2000) Real-time systems. Prentice-Hall, Englewood Cliffs Google Scholar
  21. Piao X, Han S, Kim H, Park M, Cho Y, Cho S (2006) Predictability of earliest deadline zero laxity algorithm for multiprocessor real-time systems. In: Proceedings of the 9th IEEE international symposium on object and component-oriented real-time distributed computing, pp 359–364 Google Scholar
  22. Shin I, Easwaran A, Lee I (2008) Hierarchical scheduling framework for virtual clustering of multiprocessors. In: Proceedings of the 20th Euromicro conference on real-time systems, pp 181–190 Google Scholar
  23. Stoica I, Abdel-Wahab H, Jeffay K, Baruah S, Gehrke J, Plaxton C (1996) A proportional share resource allocation algorithm for real-time, time-shared systems. In: Proceedings of the 17th IEEE real-time systems symposium, pp 288–299 Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Computer ScienceThe University of North Carolina at Chapel HillChapel HillUSA

Personalised recommendations