Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling

DOI10.1016/J.JCSS.2009.03.003zbMath1186.68061OpenAlexW1967331354MaRDI QIDQ840926

UmaMaheswari C. Devi, James H. Anderson

Publication date: 14 September 2009

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.03.003

zbMATH Keywords

schedulingmultiprocessorssoft real-timepfairnesstardiness bounds

Mathematics Subject Classification ID

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

Cites Work

• Real time scheduling theory: A historical perspective
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
• Optimal rate-based scheduling on multiprocessors

This page was built for publication: Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling