EDZL scheduling analysis

DOI10.1007/S11241-008-9061-6zbMath1194.68082OpenAlexW2500925871MaRDI QIDQ842727

Marko Bertogna, Theodore P. Baker, Michele Cirinei

Publication date: 25 September 2009

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

Full work available at URL: https://doi.org/10.1007/s11241-008-9061-6

zbMATH Keywords

schedulingmultiprocessorreal timeEDFearliest deadline firstschedulabilityearliest deadline zero laxityEDZLsymmetric multiprocessing

Mathematics Subject Classification ID

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

Related Items (8)

EDZL scheduling analysis ⋮ {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines ⋮ Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems ⋮ Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks ⋮ Laxity dynamics and LLF schedulability analysis on multiprocessor platforms ⋮ FPSL, FPCL and FPZL schedulability analysis ⋮ Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling ⋮ A survey of real-time scheduling on multiprocessor systems

Cites Work

• EDZL scheduling analysis
• Priority-driven scheduling of periodic task systems on multiprocessors
• Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks

This page was built for publication: EDZL scheduling analysis