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

Authors:
Jianghan Zhu;Xiaomin Zhu;Jianqing Jiang
Affiliations:
Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, PR China;Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, PR China;Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, 410073, PR China
Venue:
Information Processing Letters
Year:
2011

Citing 7
Cited 1

Integrated dynamic scheduling of hard and QoS degradable real-time tasks in multiprocessor systems

Journal of Systems Architecture: the EUROMICRO Journal
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control

IEEE Transactions on Computers
Toward a Taxonomy and Costing Method for Security Services

ACSAC '99 Proceedings of the 15th Annual Computer Security Applications Conference
Scheduling of a meta-task with QoS requirements in heterogeneous computing systems

Journal of Parallel and Distributed Computing
Scheduling Security-Critical Real-Time Applications on Clusters

IEEE Transactions on Computers
A two-phase scheduling strategy for real-time applications with security requirements on heterogeneous clusters

Computers and Electrical Engineering
SAQA: A Self-Adaptive QoS-Aware Scheduling Algorithm for Real-Time Tasks on Heterogeneous Clusters

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing

3E: Energy-efficient elastic scheduling for independent tasks in heterogeneous computing systems

Journal of Systems and Software

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we consider the problem of scheduling a set of independent real-time tasks with QoS requirements on a cluster, in which the adaptivity and fairness are the two important performance metrics. Thereby, we propose a novel scheduling strategy named AFSS that can guarantee: 1) excellent adaptivity, i.e., more real-time tasks can be accepted when the system is in heavy workload, and real-time tasks have high QoS levels when the system is lightly loaded; 2) fairness, i.e., real-time tasks have fair QoS levels to hold smooth processing quality. The GS and LA algorithms in AFSS are discussed and analyzed. Further, several theorems are given to prove the effectiveness of AFSS.