Skip to main content
SpringerLink
Log in

The feasibility of general task systems with precedence constraints on multiprocessor platforms

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

Abstract

Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. The collection of jobs may contain precedence constraints upon the order of execution of these jobs. The derived tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.

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, Lu C (2004) A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans Comput 53(3)

  • Baker T, Cirinei M. (2006) A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In: Proceedings of the IEEE real-time systems symposium. IEEE Computer Society Press, Rio de Janeiro, pp 178–190

    Google Scholar 

  • Baruah S (2003) Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst Int J Time-Critical Comput 24(1):99–128

    Google Scholar 

  • Baruah S, Fisher N (2006) The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans Comput 55(7):918–923

    Article  Google Scholar 

  • 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. IEEE Computer Society Press, Orlando, pp 182–190

    Chapter  Google Scholar 

  • Baruah S, Chen D, Gorinsky S, Mok A (1999) Generalized multiframe tasks. Real-Time Syst Int J Time-Critical Comput 17(1):5–22

    Article  Google Scholar 

  • Garey MR, Johnson DS, Simons BB, Tarjan RE (1981) Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J Comput 10(2):256–269

    Article  MATH  MathSciNet  Google Scholar 

  • Kolmogorov AN, Fomin SV (1970) Introductory real analysis. Dover, New York

    MATH  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

    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 

  • Murty KG (1983) Linear programming. Wiley, New York

    MATH  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

  • Spuri M, Stankovic JA (1994) How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Trans Comput 43(12):1407–1412. doi:http://dx.doi.org/10.1109/12.338100

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Wayne State University, Detroit, MI, USA

    Nathan Fisher

  2. Department of Computer Science, The University of North Carolina at Chapel Hill, Chapel Hill, NC, USA

    Sanjoy Baruah

Authors
  1. Nathan Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjoy Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nathan Fisher.

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

Fisher, N., Baruah, S. The feasibility of general task systems with precedence constraints on multiprocessor platforms. Real-Time Syst 41, 1–26 (2009). https://doi.org/10.1007/s11241-008-9054-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-008-9054-5

Keywords

Search

Navigation