Improved conditions for bounded tardiness underepdfpfair multiprocessor scheduling

DOI10.1016/J.JCSS.2009.03.003zbMATH Open1186.68061OpenAlexW1967331354MaRDI QIDQ840926FDOQ840926

Authors: 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

Recommendations

• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm
• Tardiness bounds under global EDF scheduling on a multiprocessor
• On optimal lateness and tardiness scheduling in real-time systems
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• An \(\mathsf{EDF}\)-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems

zbMATH Keywords

schedulingmultiprocessorssoft real-timepfairnesstardiness bounds

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Tardiness bounds under global EDF scheduling on a multiprocessor
• Generalized tardiness bounds for global multiprocessor scheduling
• Bounds on tardiness in scheduling of precedence-constrained unit real-time task systems
• A schedulable utilization bound for the multiprocessor \(\mathsf{EPDF}\) Pfair algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840926)