Analyzing Global-EDF for Multiprocessor Scheduling of Parallel Tasks

  • Björn Andersson
  • Dionisio de Niz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7702)


Consider the problem of scheduling a set of constrained-deadline sporadic real-time tasks on a multiprocessor where (i) all processors are identical, (ii) each task is characterized by its execution requirement, its deadline and its minimum inter-arrival time, (iii) each task generates a (potentially infinite) sequence of jobs and (iv) the execution requirement of a job and its potential for parallel execution is described by one or many stages with a stage having one or many segments such that all segments in a stage have the same execution requirement and segments in the same stage are permitted to execute in parallel and a segment is only allowed to start execution if all segments of previous stages have finished execution. We present a schedulability test for such a system where tasks are scheduled with global-EDF. This schedulability test has a resource-augmentation bound of two, meaning that if it is possible for a task set to meet deadlines (not necessarily with global-EDF) then our schedulability test guarantees that all deadlines are met when tasks are scheduled with global-EDF, assuming that the system analyzed with our schedulability test is provided processors of twice the speed.


Real-time systems Scheduling Multiprocessors Multicores 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lakshmanan, K., Kato, S., Rajkumar, R.: Scheduling Parallel Real-Time Tasks on Multi-core Processors. In: RTSS 2010 (2010)Google Scholar
  2. 2.
    Fauberteauy, F., Midonnety, S., Qamhiehy, M.: Partitioned Scheduling of Parallel Real-time Tasks on Multiprocessor Systems. SIGBED Review (2011)Google Scholar
  3. 3.
    Saifullah, A., Agrawal, K., Lu, C., Gill, C.: Multi-core Real-Time Scheduling for Generalized Parallel Task Models. In: RTSS 2011 (2011)Google Scholar
  4. 4.
    Cong, L., Anderson, J.H.: Supporting Soft Real-Time DAG-Based Systems on Multiprocessors with No Utilization Loss. In: RTSS 2010 (2010)Google Scholar
  5. 5.
    Lupu, I., Goossens, J.: Scheduling of Hard Real-Time Multi-Thread Periodic Tasks. In: RTNS 2011 (2011)Google Scholar
  6. 6.
    Kato, S., Ishikawa, Y.: Gang EDF Scheduling of Parallel Task Systems. In: RTSS 2009 (2009)Google Scholar
  7. 7.
    Jayachandran, P., Abdelzaher, T.: Reduction-based schedulability analysis of distributed systems with cycles in the task graph. Journal Real-Time Systems (2010)Google Scholar
  8. 8.
    Goddard, S.: On the Management of Latency in the Synthesis of Real-Time Signal Processing Systems from Processing Graphs. PhD thesis (1998)Google Scholar
  9. 9.
    Gerber, R., Hong, S., Saksena, M.: Guaranteeing end-to-end timing constraints by calibrating intermediate processes. In: RTSS 1994 (1994)Google Scholar
  10. 10.
    Audsley, N.C., Burns, A., Richardson, M.F., Wellings, A.J.: Data Consistency In Hard Real-Time Systems. Informatica (1993)Google Scholar
  11. 11.
    Philips, C., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: STOC 1997 (1997)Google Scholar
  12. 12.
    Baruah, S.K., Bonifaci, V., Marchetti-Spaccamela, A., Stiller, S.: Improved multiprocessor global schedulability analysis. In: Real-Time Systems (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Björn Andersson
    • 1
  • Dionisio de Niz
    • 1
  1. 1.Software Engineering InstituteCarnegie Mellon UniversityUSA

Personalised recommendations