Skip to main content
SpringerLink
Log in

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

  • Published:
Real-Time Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abdelzaher T, Sharma V, Lu C (2004) A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans Comput 53(3):334

    Article  Google Scholar 

  • 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

    Chapter  Google Scholar 

  • Baker TP (2003) An analysis of deadline-monotonic schedulability on a multiprocessor. Technical Report TR-030201, Department of Computer Science, Florida State University

  • 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

    Article  MATH  Google Scholar 

  • 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 

  • 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

  • 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

    Article  Google Scholar 

  • 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

    Chapter  Google Scholar 

  • 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 

  • 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 

  • 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

  • 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

    Chapter  Google Scholar 

  • 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 

  • 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

  • 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 

  • Leung J, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform Evaluation 2:237–250

    Article  MathSciNet  Google Scholar 

  • Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):46–61

    Article  MATH  MathSciNet  Google Scholar 

  • 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

  • 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 

  • Mok AK, Chen D (1997) A multiframe model for real-time tasks. IEEE Trans Softw Eng 23(10):635–645

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

  • 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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of North Carolina at Chapel Hill, CB-3175, Chapel Hill, NC, 27599-3175, USA

    Sanjoy Baruah & Nathan Fisher

Authors
  1. Sanjoy Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nathan Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjoy Baruah.

Additional information

This research has been supported in part by the National Science Foundation (Grant Nos. ITR-0082866, CCR-0204312, and CCR-0309825).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baruah, S., Fisher, N. Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems. Real-Time Syst 39, 97–122 (2008). https://doi.org/10.1007/s11241-006-9009-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-006-9009-7

Keywords

Search

Navigation