Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Parallel simulation of mechanical systems for real-time applications
Systems Analysis Modelling Simulation
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An Efficient Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
On-line scheduling of scalable real-time tasks on multiprocessor systems
Journal of Parallel and Distributed Computing
Scheduling Divisible Loads on Star and Tree Networks: Results and Open Problems
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Multiround Algorithms for Scheduling Divisible Loads
IEEE Transactions on Parallel and Distributed Systems
On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Real-Time Divisible Load Scheduling with Different Processor Available Times
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Scheduling Divisible Real-Time Loads on Clusters with Varying Processor Start Times
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Real-Time Divisible Load Scheduling with Advance Reservation
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Real-time scheduling of divisible loads in cluster computing environments
Journal of Parallel and Distributed Computing
Scheduling Multisource Divisible Loads on Arbitrary Networks
IEEE Transactions on Parallel and Distributed Systems
Multi-round real-time divisible load scheduling for clusters
HiPC'08 Proceedings of the 15th international conference on High performance computing
IEEE Transactions on Parallel and Distributed Systems
Aligning biological sequences on distributed bus networks: a divisible load scheduling approach
IEEE Transactions on Information Technology in Biomedicine
Computing BLAS level-2 operations on workstation clusters using the divisible load paradigm
Mathematical and Computer Modelling: An International Journal
Design and implementation of parallel video encoding strategies using divisible load analysis
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
This paper investigates the real-time scheduling problem for handling heterogeneous divisible loads on cluster systems. Divisible load applications occur in many fields of science and engineering. Such applications can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. We consider divisible loads associated with deadlines to enhance quality-of-service (QoS) and provide performance guarantees in distributed computing environments. In addition, since the divisible loads to be performed may widely vary in terms of their required hardware and software, we capture the loads' various processing requirements in our load distribution strategies, a unique feature that is applicable for running proprietary applications only on certain eligible processing nodes. Thus in our problem formulation each load can only be processed by certain processors as both the loads and processors are heterogeneous. We propose scheduling algorithms referred to as Requirements-Aware Real-Time Scheduling (RARTS) algorithms, which consist of a novel scheduling policy, referred to as Minimum Slack Capacity First (MSCF), and two multi-round load distribution strategies, referred to as All Eligible Processors (AEP) and Least Capability First (LCF). We perform rigorous performance evaluation studies to quantify the performance of our strategies on a variety of scenarios.