Amortized efficiency of list update and paging rules
Communications of the ACM
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Scheduling for Overload in Real-Time Systems
IEEE Transactions on Computers
Approximating the throughput of multiple machines under real-time scheduling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Patience is a virtue: the effect of slack on competitiveness for admission control
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On-line Scheduling with Hard Deadlines (Extended Abstract)
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Online real-time preemptive scheduling of jobs with deadlines
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Maximizing the throughput of multiple machines on-line
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
We consider an on-line non-preemptive deadline scheduling on multiple resources. Each job has the slack time during which it can wait until its expiration time, the last time it can be started to be completed by the deadline. There are a number of resources on which the jobs are allocated. The effect of slack times on the on-line deadline scheduling was investigated in [8] by analyzing the performance of the Earliest EXpiration Time First (EXF) algorithm. But most of the previous work is restricted to a single resource, and in this paper, we propose a different method of analysis which can also be applied to multiple resources. So we can extend the result of [8] to multiple resources.