Submitted by claxton on
|Title||Scheduling Independent Stochastic Tasks under Deadline and Budget Constraints|
|Publication Type||Journal Article|
|Year of Publication||2019|
|Authors||Canon, L-C., A K W. Chang, Y. Robert, and F. Vivien|
|Journal||International Journal of High Performance Computing Applications|
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an efficient heuristic which is shown to outperform standard approaches when running simulations for a variety of useful distribution laws.