A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines
IEEE Transactions on Software Engineering
LSTF: a new scheduling policy for complex real-time tasks in multiple processor systems
Automatica (Journal of IFAC)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults
IEEE Transactions on Computers
Applications and extensions of the imprecise-computation model
Applications and extensions of the imprecise-computation model
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Towards a general model of the multi-criteria workflow scheduling on the grid
Future Generation Computer Systems
IEEE Transactions on Parallel and Distributed Systems
Scheduling workflow applications on processors with different capabilities
Future Generation Computer Systems - Collaborative and learning applications of grid technology
Journal of Systems and Software
QoS-Aware Fault-Tolerant Scheduling for Real-Time Tasks on Heterogeneous Clusters
IEEE Transactions on Computers
A stochastic scheduling algorithm for precedence constrained tasks on Grid
Future Generation Computer Systems
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
| Hi-index | 0.00 |
In this paper, we investigate the improvement that can be gained in the performance of a heterogeneous cluster dedicated to real-time jobs, by exploiting schedule holes with a novel approach that combines imprecise computations and bin packing strategies. According to the imprecise computations technique, a real-time job can trade off precision for timeliness. Each job that arrives at the system has an end-to-end deadline and is a directed acyclic graph of component tasks, where the output data of a task may be used as input by another task. In case the input data of a task are imprecise, the task's execution time is extended, in order to correct the error and produce a result of acceptable quality. Due to the data dependencies between the tasks of a job, schedule holes may appear in the schedule of a particular processor. Our approach is compared with other scheduling policies, under various workloads. The simulation results show that in the framework under study, the proposed strategy can lead to a better system performance.