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

DOI10.1007/S11241-011-9121-1MaRDI QIDQ554016zbMATH OpenOpenAlexFDO

Authors Xuan Qi, Dakai Zhu, Hakan Aydin

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

bfair algorithmcluster schedulingmultiprocessorsreal-time systemsscheduling overheadutilization bound

Mathematics Subject Classification ID

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

Recommendations

• Dynamic Scheduling of Hybrid Real-Time Tasks on Clusters
• Resource sharing among real-time components under multiprocessor clustered scheduling
• Real-time scheduling of divisible loads in cluster computing environments
• scientific article; zbMATH DE number 1487629
• Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling
• A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters

Cites work

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

Cited in

(4)

• Optimal virtual cluster-based multiprocessor scheduling
• Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling
• An optimal boundary fair scheduling
• Real-time scheduling of divisible loads in cluster computing environments

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

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