When Amdahl Meets Young/Daly - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

When Amdahl Meets Young/Daly


This paper investigates the optimal number of processors to execute a parallel job, whose speedup profile obeys Amdahl's law, on a large-scale platform subject to fail-stop and silent errors. We combine the traditional checkpointing and rollback recovery strategies with verification mechanisms to cope with both error sources. We provide an exact formula to express the execution overhead incurred by a periodic checkpointing pattern of length T and with P processors, and we give first-order approximations for the optimal values T * and P * as a function of the individual processor failure rate λind. A striking result is that P * is of the order λ −1/4 ind if the checkpointing cost grows linearly with the number of processors, and of the order λ −1/3 ind if the checkpointing cost stays bounded for any P. We conduct an extensive set of simulations to support the theoretical study. The results confirm the accuracy of first-order approximation under a wide range of parameter settings.
Fichier principal
Vignette du fichier
cluster2016.pdf (832.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01355963 , version 1 (24-08-2016)


  • HAL Id : hal-01355963 , version 1


Aurélien Cavelan, Jiafan Li, Yves Robert, Hongyang Sun. When Amdahl Meets Young/Daly. Cluster'2016, Sep 2016, Taipei, Taiwan, France. ⟨hal-01355963⟩
159 View
75 Download


Gmail Facebook X LinkedIn More