Advertisement

Real-Time Systems

, Volume 39, Issue 1–3, pp 97–122 | Cite as

Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

  • Sanjoy BaruahEmail author
  • Nathan Fisher
Article

Abstract

The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where job migration between processors is forbidden. The fixed-priority scheduling of real-time jobs with job migration is analyzed, and sufficient tests of schedulability are obtained for the deadline-monotonic (dm) and the earliest-deadline-first (edf) scheduling algorithms. The feasibility and schedulability tests of this paper may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed. In particular, sufficient conditions for the dm scheduling of sporadic task systems are derived and compared to previously-known tests.

Keywords

Multiprocessor platforms Feasibility analysis Schedulability analysis Sufficient conditions Fixed-priority scheduling Recurrent tasks 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdelzaher T, Sharma V, Lu C (2004) A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans Comput 53(3):334 CrossRefGoogle Scholar
  2. 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
  3. Baker TP (2003) An analysis of deadline-monotonic schedulability on a multiprocessor. Technical Report TR-030201, Department of Computer Science, Florida State University Google Scholar
  4. Baker TP (2006) An analysis of fixed-priority schedulability on a multiprocessor. Real-Time Syst Int J Time-Crit Comput 32(1–2):49–71 zbMATHCrossRefGoogle Scholar
  5. Baruah S (2003) Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst Int J Time-Crit Comput 24(1):99–128 Google Scholar
  6. Baruah S, Fisher N (2005) The partitioned scheduling of sporadic real-time tasks on multiprocessor platforms. In: Proceedings of the workshop on compile/runtime techniques for parallel computing, Oslo, Norway, June 2005 Google Scholar
  7. Baruah S, Howell R, Rosier L (1990a) Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst Int J Time-Crit Comput 2:301–324 CrossRefGoogle Scholar
  8. Baruah S, Mok A, Rosier L (1990b) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th real-time systems symposium. Orlando, FL. IEEE Computer Society, Los Alamitos, pp 182–190 CrossRefGoogle Scholar
  9. Baruah S, Chen D, Gorinsky S, Mok A (1999) Generalized multiframe tasks. Real-Time Syst Int J Time-Crit Comput, 17(1):5–22 Google Scholar
  10. Bertogna M, Cirinei M, Lipari G (2005) 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
  11. Chakraborty S (2003) System-level timing analysis and scheduling for embedded packet processors. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich. Available as Diss. ETH No. 15093 Google Scholar
  12. Chakraborty S, Erlebach T, Thiele L (2001) On the complexity of scheduling conditional real-time code. In: Proceedings of the 7th workshop on algorithms and data structures. Providence, RI. Springer, Berlin, pp 38–49 CrossRefGoogle Scholar
  13. Fisher N, Baruah S (2005a) A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems. In: Proceedings of the euromicro conference on real-time systems. Palma de Mallorca, Balearic Islands, Spain, July 2005. IEEE Computer Society, Los Alamitos, pp 117–126 Google Scholar
  14. Fisher N, Baruah S (2005b) A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines. In: Proceedings of the 13th international conference on real-time systems, Paris, France, April 2005 Google Scholar
  15. Fisher N, Baker TP, Baruah S (2006) Algorithms for determining the demand-based load of a sporadic task system. In: Proceedings of the international conference on real-time computing systems and applications. Sydney, Australia, August 2006. IEEE Computer Society, Los Alamitos Google 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 zbMATHCrossRefMathSciNetGoogle Scholar
  18. 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. Available as Technical Report No. MIT/LCS/TR-297 Google Scholar
  19. Mok AK, Chen D (1996) A multiframe model for real-time tasks. In: Proceedings of the 17th real-time systems symposium. Washington, DC. IEEE Computer Society, Los Alamitos Google Scholar
  20. Mok AK, Chen D (1997) A multiframe model for real-time tasks. IEEE Trans Softw Eng 23(10):635–645 CrossRefGoogle Scholar
  21. Parekh AK, Gallager RG (1993) A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Trans Netw 1(3):344–357 CrossRefGoogle Scholar
  22. Parekh AK, Gallager RG (1994) A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans Netw 2(2):137–150 CrossRefGoogle Scholar
  23. 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, TX, 4–6 May 1997, pp 140–149 Google Scholar
  24. Ripoll I, Crespo A, Mok AK (1996) Improvement in feasibility testing for real-time tasks. Real-Time Syst Int J Time-Crit Comput 11:19–39 CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

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

Personalised recommendations