On the Scheduling of Checkpoints on Desktop Grids

Mohamed Slim Bouguerra 1 Derrick Kondo 2 Denis Trystram 1, 3
1 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Frequent resources failures are a major challenge for the rapid completion of batch jobs. Check pointing and migration is one approach to accelerate job completion avoiding deadlock. We study the problem of scheduling checkpoints of sequential jobs in the context of Desktop Grids, consisting of volunteered distributed resources. We craft a checkpoint scheduling algorithm that is provably optimal for discrete time when failures obey any general probability distribution. We show using simulations with parameters based on real-world systems that this optimal strategy scales and outperforms other strategies significantly in terms of check pointing costs and batch completion times.
Complete list of metadatas

https://hal.inria.fr/hal-00788788
Contributor : Arnaud Legrand <>
Submitted on : Friday, February 15, 2013 - 11:16:29 AM
Last modification on : Wednesday, March 13, 2019 - 3:02:07 PM

Identifiers

Collections

Citation

Mohamed Slim Bouguerra, Derrick Kondo, Denis Trystram. On the Scheduling of Checkpoints on Desktop Grids. 11th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing (CCGrid 2011), 2011, Newport Beach, United States. pp.305-313, ⟨10.1109/CCGrid.2011.63⟩. ⟨hal-00788788⟩

Share

Metrics

Record views

329