Cluster scheduling for real-time systems: utilization bounds and run-time overhead

DOI10.1007/S11241-011-9121-1zbMath1217.68041OpenAlexW2066160033MaRDI QIDQ554016

Dakai Zhu, Hakan Aydin, Xuan Qi

Publication date: 29 July 2011

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

Full work available at URL: https://doi.org/10.1007/s11241-011-9121-1

zbMATH Keywords

real-time systemsmultiprocessorsbfair algorithmcluster schedulingscheduling overheadutilization bound

Mathematics Subject Classification ID

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

Related Items (1)

An optimal boundary fair scheduling

Cites Work

• {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
• Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
• Utility accrual real-time scheduling for multiprocessor embedded systems
• T-L plane-based real-time scheduling for homogeneous multiprocessors
• Priority-driven scheduling of periodic task systems on multiprocessors
• Utilization bounds for EDF scheduling on real-time multiprocessor systems
• Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
• Proportionate progress: A notion of fairness in resource allocation
• Schedulability analysis of global EDF
• On a Real-Time Scheduling Problem
• New strategies for assigning real-time tasks to multiprocessor systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Cluster scheduling for real-time systems: utilization bounds and run-time overhead