Skip to Main content Skip to Navigation
Reports

Scheduling independent stochastic tasks deadline and budget constraints

Abstract : This paper 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 IID 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.
Document type :
Reports
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

https://hal.inria.fr/hal-01811885
Contributor : Equipe Roma <>
Submitted on : Monday, June 11, 2018 - 7:55:12 AM
Last modification on : Wednesday, September 16, 2020 - 10:42:49 AM
Long-term archiving on: : Wednesday, September 12, 2018 - 7:50:41 PM

File

rr9178.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01811885, version 1

Citation

Louis-Claude Canon, Aurélie Kong Win Chang, Yves Robert, Frédéric Vivien. Scheduling independent stochastic tasks deadline and budget constraints. [Research Report] RR-9178, Inria - Research Centre Grenoble – Rhône-Alpes. 2018, pp.1-34. ⟨hal-01811885⟩

Share

Metrics

Record views

209

Files downloads

215