Reservation and Checkpointing Strategies for Stochastic Jobs - Archive ouverte HAL Access content directly
Conference Papers Year :

Reservation and Checkpointing Strategies for Stochastic Jobs

(1) , (2, 3) , (2, 3) , (2, 3) , (1) , (4, 5, 6) , (1)
1
2
3
4
5
6

Abstract

In this paper, we are interested in scheduling and checkpointing stochastic jobs on a reservation-based platform, whose cost depends both (i) on the reservation made, and (ii) on the actual execution time of the job. Stochastic jobs are jobs whose execution time cannot be determined easily. They arise from the heterogeneous, dynamic and data-intensive requirements of new emerging fields such as neuroscience. In this study, we assume that jobs can be interrupted at any time to take a checkpoint, and that job execution times follow a known probability distribution. Based on past experience, the user has to determine a sequence of fixed-length reservation requests, and to decide whether the state of the execution should be checkpointed at the end of each request. The objective is to minimize the expected cost of a successful execution of the jobs. We provide an optimal strategy for discrete probability distributions of job execution times, and we design fully polynomial-time approximation strategies for continuous distributions with bounded support. These strategies are then experimentally evaluated and compared to standard approaches such as periodic-length reservations and simple checkpointing strategies (either checkpoint all reservations, or none). The impact of an imprecise knowledge of checkpoint and restart costs is also assessed experimentally.
Fichier principal
Vignette du fichier
ipdps-hal.pdf (771.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03029298 , version 1 (30-11-2020)

Identifiers

  • HAL Id : hal-03029298 , version 1

Cite

Ana Gainaru, Brice Goglin, Valentin Honoré, Guillaume Pallez, Padma Raghavan, et al.. Reservation and Checkpointing Strategies for Stochastic Jobs. IPDPS 2020 - 34th IEEE International Parallel and Distributed Processing Symposium, May 2020, New Orleans, LA / Virtual, United States. pp.1-26. ⟨hal-03029298⟩
166 View
243 Download

Share

Gmail Facebook Twitter LinkedIn More