Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling

DOI10.1007/s11241-013-9190-4zbMath1291.68077OpenAlexW2006539751MaRDI QIDQ2251390

Jeremy P. Erickson, James H. Anderson, Bryan C. Ward

Publication date: 14 July 2014

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

Full work available at URL: https://doi.org/10.1007/s11241-013-9190-4

zbMATH Keywords

soft real-timeglobal EDFbounded tardinessglobal fair lateness

Mathematics Subject Classification ID

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

Related Items (2)

Using a lag-balance property to tighten tardiness bounds for global EDF ⋮ A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF

Cites Work

• EDZL scheduling analysis
• Deadline-based scheduling of periodic task systems on multiprocessors.
• Minimizing the sum of the \(k\) largest functions in linear time.
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• Generalized tardiness bounds for global multiprocessor scheduling
• Tardiness bounds under global EDF scheduling on a multiprocessor

This page was built for publication: Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling