How much can lookahead help in online single machine scheduling
Information Processing Letters
A lazy EDF interrupt scheduling algorithm for multiprocessor in parallel computing environment
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Courteous algorithm: performance optimization in WiMAX networks
CIT'10 Proceedings of the 4th international conference on Communications and information technology
Task scheduling in heterogeneous distributed systems with security and QoS requirements
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.00 |
It is well-known that although EDF is optimal for preemptive systems this is not the case in non-preemptive ones. The problem is that for a non-preemptive scheduler to be optimal, it must sometimes use inserted idle times. In this paper we show how the performance of non-preemptive EDF can be improved by using a form of lookahead that identifies when idle time insertion is necessary. Experiments show that this modification increases the number of schedulable task sets by up to 100%. Furthermore, by using a form of lazy evaluation the algorithm runs in which is the same as plain EDF.