An optimal boundary fair scheduling algorithm for multiprocessor real-time systems

DOI10.1016/J.JPDC.2011.06.003MaRDI QIDQ645817zbMATH OpenOpenAlexFDO

Authors Dakai Zhu, Xuan Qi, Daniel Mossé, Rami Melhem

Publication date 10 November 2011

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2011.06.003

zbMATH Keywords

boundary fairness (Bfair) schedulingmultiprocessoroptimal scheduling algorithmsperiodic tasksreal-time systems

Mathematics Subject Classification ID

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

Recommendations

• An optimal boundary fair scheduling
• A new fair scheduling algorithm for periodic tasks on multiprocessors
• Optimal rate-based scheduling on multiprocessors
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• An optimal multiprocessor real-time scheduling algorithm

Cites work

• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• On a Real-Time Scheduling Problem
• Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible
• Optimal rate-based scheduling on multiprocessors
• Priority-driven scheduling of periodic task systems on multiprocessors
• Proportionate progress: A notion of fairness in resource allocation
• Real time scheduling theory: A historical perspective
• Schedulability analysis of global EDF
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling with deadlines and loss functions
• T-L plane-based real-time scheduling for homogeneous multiprocessors
• Time bounds for selection
• Utility accrual real-time scheduling for multiprocessor embedded systems
• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling

Cited in

(6)

• A new fair scheduling algorithm for periodic tasks on multiprocessors
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• An optimal boundary fair scheduling
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• Partition oriented frame based fair scheduler

This page was built for publication: An optimal boundary fair scheduling algorithm for multiprocessor real-time systems

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