Abstract
The multiprocessor edf scheduling of sporadic task systems is studied. A new sufficient schedulability test is presented and proved correct. It is shown that this test generalizes the previously-known exact uniprocessor edf-schedulability test, and that it offers non-trivial quantitative guarantees (including a resource augmentation bound) on multiprocessors.
Similar content being viewed by others
References
Baker T (2003) Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the IEEE real-time systems symposium, December 2003. IEEE Computer Society Press, Los Alamitos, pp 120–129
Baker TP (2005) An analysis of EDF schedulability on a multiprocessor. IEEE Trans Parallel Distrib Syst 16(8):760–768
Baker TP, Fisher N, Baruah S (2005) Algorithms for determining the load of a sporadic task system. Technical Report TR-051201, Department of Computer Science, Florida State University
Baruah S (2004) Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans Comput 53:6
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, Florida. IEEE Computer Society Press, Los Alamitos, pp 182–190
Bertogna M, Cirinei M, Lipari G (2005) 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 Press, Los Alamitos, pp 209–218
Dertouzos M (1974) Control robotics: The procedural control of physical processors. In: Proceedings of the IFIP congress, pp 807–813
Fisher N, Baker T, Baruah S (2006a) 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 Press, Los Alamitos
Fisher N, Baruah S, Baker T (2006b) 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 Press, Los Alamitos
Goossens J, Funk S, Baruah S (2003) Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Syst 25(2–3):187–205
Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):46–61
Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. thesis, Laboratory for Computer Science, Massachusetts Institute of Technology. Available as Technical Report No. MIT/LCS/TR-297
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
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
Srinivasan A, Baruah S (2002) Deadline-based scheduling of periodic task systems on multiprocessors. Inf Process Lett 84(2):93–98
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baruah, S., Baker, T. Schedulability analysis of global edf . Real-Time Syst 38, 223–235 (2008). https://doi.org/10.1007/s11241-007-9047-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-007-9047-9