An optimal boundary fair scheduling

DOI10.1007/S11241-014-9201-0zbMath1291.68090OpenAlexW2037702235MaRDI QIDQ2251416

Hang Su, Yifeng Guo, Geoffrey Nelissen, Joël Goossens, Dakai Zhu, Vincent Nelis

Publication date: 14 July 2014

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

Full work available at URL: http://hdl.handle.net/10400.22/5411

zbMATH Keywords

fairnessschedulingdiscrete-timeoptimalmultiprocessorreal-time

Mathematics Subject Classification ID

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

Cites Work

• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• A new fair scheduling algorithm for periodic tasks on multiprocessors
• Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
• Scheduling with Deadlines and Loss Functions
• Proportionate progress
• Optimal rate-based scheduling on multiprocessors

This page was built for publication: An optimal boundary fair scheduling