Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis
IEEE Transactions on Parallel and Distributed Systems
QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control
IEEE Transactions on Computers
Real-Time Systems
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Toward a Taxonomy and Costing Method for Security Services
ACSAC '99 Proceedings of the 15th Annual Computer Security Applications Conference
Selective Buddy Allocation for Scheduling Parallel Jobs on Clusters
CLUSTER '02 Proceedings of the IEEE International Conference on Cluster Computing
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Fault-tolerant scheduling for real-time embedded control systems
Journal of Computer Science and Technology
Dynamic Scheduling of Parallel Jobs with QoS Demands in Multiclusters and Grids
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Journal of Parallel and Distributed Computing
Scheduling Security-Critical Real-Time Applications on Clusters
IEEE Transactions on Computers
Scalable algorithms for molecular dynamics simulations on commodity clusters
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
A non-preemptive scheduling algorithm for soft real-time systems
Computers and Electrical Engineering
Computers and Electrical Engineering
NP-complete scheduling problems
Journal of Computer and System Sciences
Information Processing Letters
Journal of Systems and Software
Adaptive energy-efficient scheduling for real-time tasks on DVS-enabled heterogeneous clusters
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Nowadays, providing quality of service (QoS) guarantees for some applications such as signal data processing has become a critical issue. In this paper, we propose a novel self-adaptive QoS-aware scheduling algorithm called SAQA that sufficiently considers the adaptability for real-time tasks with QoS demands on heterogeneous clusters. When the system is in heavy load, the SAQA algorithm can degrade the QoS levels of new tasks or tasks waiting in local queues of nodes to guarantee high schedul ability. The minimum QoS level is acceptable for each task. In contrast, when the system is in light load, SAQA can use slack time to adequately improve the QoS of new tasks. We compare SAQA with SAEDF algorithm by simulations. The experimental results indicate that SAQA has admirable adaptability while providing timing and QoS guarantees.