Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On-line scheduling of parallel jobs with runtime restrictions
Theoretical Computer Science
On an on-line scheduling problem for parallel jobs
Information Processing Letters
On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Scheduling parallel jobs to minimize the makespan
Journal of Scheduling
On-Line Multiple-Strip Packing
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Online algorithm for parallel job scheduling and strip packing
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Theoretical Computer Science
Improved online algorithms for parallel job scheduling and strip packing
Theoretical Computer Science
Online scheduling of parallel jobs on two machines is 2-competitive
Operations Research Letters
On-line scheduling of multi-core processor tasks with virtualization
Operations Research Letters
Coordination mechanisms for selfish parallel jobs scheduling
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Job scheduling using successive linear programming approximations of a sparse model
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
| Hi-index | 0.00 |
We study an on-line parallel job scheduling problem, where jobs arrive one by one. A parallel job may require a number of machines for its processing at the same time. Upon arrival of a job, its processing time and the number of requested machines become known, and it must be scheduled immediately without any knowledge of future jobs. We present a 7-competitive on-line algorithm, which improves the previous upper bound of 12 by Johannes (J. Sched. 9:433---452, 2006). Furthermore, we investigate a special case in which the largest processing time is known beforehand.