TY - GEN
T1 - Algorithms for scheduling deadline-sensitive malleable tasks
AU - Wu, Xiaohu
AU - Loiseau, Patrick
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2016/4/4
Y1 - 2016/4/4
N2 - Due to the ubiquity of batch data processing in cloud computing, the fundamental problem of scheduling malleable batch tasks and its extensions have received significant attention recently. In this paper, we consider an important model in which a set of n tasks is to be scheduled on C identical machines and each task is specified by a value, a workload, a deadline and a parallelism bound. Within the parallelism bound, the number of machines allocated to a task can vary over time without affecting its workload. For this model, we obtain two core results: a quantitative characterization of a sufficient and necessary condition such that a set of malleable batch tasks with deadlines can be scheduled on C machines, and a polynomial-time algorithm to produce such a feasible schedule. These core results provide a conceptual tool and an optimal scheduling algorithm that enable proposing new analyses and designs of algorithms and improving existing algorithms for extensive scheduling objectives.
AB - Due to the ubiquity of batch data processing in cloud computing, the fundamental problem of scheduling malleable batch tasks and its extensions have received significant attention recently. In this paper, we consider an important model in which a set of n tasks is to be scheduled on C identical machines and each task is specified by a value, a workload, a deadline and a parallelism bound. Within the parallelism bound, the number of machines allocated to a task can vary over time without affecting its workload. For this model, we obtain two core results: a quantitative characterization of a sufficient and necessary condition such that a set of malleable batch tasks with deadlines can be scheduled on C machines, and a polynomial-time algorithm to produce such a feasible schedule. These core results provide a conceptual tool and an optimal scheduling algorithm that enable proposing new analyses and designs of algorithms and improving existing algorithms for extensive scheduling objectives.
U2 - 10.1109/ALLERTON.2015.7447050
DO - 10.1109/ALLERTON.2015.7447050
M3 - Conference contribution
AN - SCOPUS:84969802416
T3 - 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
SP - 530
EP - 537
BT - 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015
Y2 - 29 September 2015 through 2 October 2015
ER -