Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling

DOI10.1016/J.IPL.2011.03.020MaRDI QIDQ1944965zbMATH OpenOpenAlexFDO

Authors Jianghan Zhu, Xiaomin Zhu, Jianqing Jiang

Publication date 28 March 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.03.020

zbMATH Keywords

adaptivityclusterfairnessreal-timescheduling

Mathematics Subject Classification ID

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

Recommendations

• A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters
• A two-phase scheduling strategy for real-time applications with security requirements on heterogeneous clusters
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead
• Quasi-partitioned scheduling: optimality and adaptation in multiprocessor real-time systems
• On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees

Cites work

• A two-phase scheduling strategy for real-time applications with security requirements on heterogeneous clusters
• Scheduling of a meta-task with qos requirements in heterogeneous computing systems

Cited in

(4)

• A two-phase scheduling strategy for real-time applications with security requirements on heterogeneous clusters
• A dynamic and reliability-driven scheduling algorithm for parallel real-time jobs executing on heterogeneous clusters
• An Efficient Real-Time Disk-Scheduling Framework with Adaptive Quality Guarantee
• Cluster scheduling for real-time systems: utilization bounds and run-time overhead

This page was built for publication: Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling

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