An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems

DOI10.1007/s11241-009-9075-8zbMath1186.68056OpenAlexW2060540493MaRDI QIDQ1039307

Theodore P. Baker, Sanjoy K. Baruah

Publication date: 27 November 2009

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-009-9075-8

zbMATH Keywords

multiprocessor schedulingschedulability analysisEDFearliest deadline firstglobal schedulingsporadic task systemsarbitrary deadlines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems ⋮ A constant-approximate feasibility test for multiprocessor real-time scheduling ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Implementation and evaluation of global and partitioned scheduling in a real-time OS ⋮ Integrating job parallelism in real-time scheduling theory ⋮ Optimal virtual cluster-based multiprocessor scheduling ⋮ A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Cites Work

• Unnamed Item
• Priority-driven scheduling of periodic task systems on multiprocessors
• Deadline-based scheduling of periodic task systems on multiprocessors.
• Schedulability analysis of global EDF
• The partitioned dynamic-priority scheduling of sporadic task systems
• Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: An analysis of global \texttt{EDF} schedulability for arbitrary-deadline sporadic task systems