Real-Time Systems

, Volume 36, Issue 3, pp 199–226 | Cite as

The partitioned dynamic-priority scheduling of sporadic task systems

Article

Abstract

A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation.

Keywords

Sporadic tasks Partitioned scheduling Multiprocessors 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers K, Slomka F (2004) An event stream driven approximation for the analysis of real-time systems. In: Proceedings of the EuroMicro conference on real-time systems, Catania, Sicily, July 2004. IEEE Computer Society, Los Alamitos, pp 187–195 CrossRefGoogle Scholar
  2. Audsley N, Burns A, Wellings A (1993) Deadline monotonic scheduling theory and application. Control Eng Pract 1(1):71–78 CrossRefGoogle Scholar
  3. Baker T (2003) Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the IEEE real-time systems symposium, December 2003, IEEE Computer Society, Los Alamitos, pp 120–129 Google Scholar
  4. Baker TP (2005a) An analysis of EDF schedulability on a multiprocessor. IEEE Trans Parallel Distrib Syst 16(8):760–768 CrossRefGoogle Scholar
  5. Baker TP (2005b) Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Technical Report TR-050601, Department of Computer Science, Florida State University Google Scholar
  6. Baker TP (2006) A comparison of global and partitioned EDF schedulability tests for multiprocessors. In: Proceeding of the international conference on real-time and network systems, Poitiers, France Google Scholar
  7. Baruah S, Mok A, Rosier L (1990) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th real-time systems symposium, Orlando, FL, 1990. IEEE Computer Society, Los Alamitos Google Scholar
  8. Bertogna M, Cirinei M, Lipari G (2005a) Improved schedulability analysis of EDF on multiprocessor platforms. In: Proceedings of the EuroMicro conference on real-time systems, Palma de Mallorca, Balearic Islands, Spain, July 2005. IEEE Computer Society, Los Alamitos, pp 209–218 Google Scholar
  9. Bertogna M, Cirinei M, Lipari G (2005b) New schedulability tests for real-time tasks sets scheduled by deadline monotonic on multiprocessors. In: Proceedings of the 9th international conference on principles of distributed systems, Pisa, Italy, December 2005. IEEE Computer Society, Los Alamitos Google Scholar
  10. Dertouzos M (1974) Control robotics: the procedural control of physical processors. In: Proceedings of the IFIP Congress, pp 807–813 Google Scholar
  11. Fisher N, Baruah S, Baker T (2006) The partitioned scheduling of sporadic tasks according to static priorities. In: Proceedings of the EuroMicro conference on real-time systems, Dresden, Germany, July 2006. IEEE Computer Society, Los Alamitos Google Scholar
  12. Johnson D (1974) Fast algorithms for bin packing. J Comput Syst Sci 8(3):272–314 MATHGoogle Scholar
  13. Johnson DS (1973) Near-optimal bin packing algorithms. PhD thesis, Department of Mathematics, Massachusetts Institute of Technology Google Scholar
  14. Lehoczky JP (1990) Fixed priority scheduling of periodic tasks with arbitrary deadlines. In: IEEE real-time systems symposium, December 1990, pp 201–209 Google Scholar
  15. Leung J, Merrill M (1980) A note on the preemptive scheduling of periodic, real-time tasks. Inform Process Lett 11:115–118 MATHCrossRefMathSciNetGoogle Scholar
  16. Leung J, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform Evaluation 2:237–250 CrossRefMathSciNetGoogle Scholar
  17. Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):46–61 MATHCrossRefMathSciNetGoogle Scholar
  18. Liu JWS (2000) Real-time systems. Prentice-Hall, Upper Saddle River Google Scholar
  19. Lopez JM, Garcia M, Diaz JL, Garcia DF (2000) Worst-case utilization bound for EDF scheduling in real-time multiprocessor systems. In: Proceedings of the EuroMicro conference on real-time systems, Stockholm, Sweden, June 2000. IEEE Computer Society, Los Alamitos, pp 25–34 CrossRefGoogle Scholar
  20. Lopez JM, Diaz JL, Garcia DF (2004) Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Syst 28(1):39–68 MATHCrossRefGoogle Scholar
  21. Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, 1983. Available as Technical Report No. MIT/LCS/TR-297 Google Scholar
  22. Phillips CA, Stein C, Torng E, Wein J (1997) Optimal time-critical scheduling via resource augmentation. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, El Paso, Texas, 4–6 May 1997, pp 140–149 Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of North CarolinaChapel HillUSA

Personalised recommendations