Prediction of Parallel Speed-ups for Las Vegas Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Prediction of Parallel Speed-ups for Las Vegas Algorithms

Résumé

We propose a probabilistic model for the parallel execution of Las Vegas algorithms, i.e. randomized algorithms whose runtime might vary from one execution to another, even with the same input. This model aims at predicting the parallel performances (i.e. speedups) by analysis the runtime distribution of the sequential runs of the algorithm. Then, we study in practice the case of a particular Las Vegas algorithm for combinatorial optimization on three classical problems, and compare the model with an actual parallel implementation up to 256 cores. We show that the prediction can be accurate, matching the actual speedups very well up to 100 parallel cores and then with a deviation of about 20% up to 256 cores.
Fichier principal
Vignette du fichier
prediction.pdf (757.59 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00870979 , version 1 (08-10-2013)

Identifiants

Citer

Charlotte Truchet, Florian Richoux, Philippe Codognet. Prediction of Parallel Speed-ups for Las Vegas Algorithms. 42nd International Conference on Parallel Processing, 2013, Lyon, France. pp.160-169, ⟨10.1109/ICPP.2013.25⟩. ⟨hal-00870979⟩
211 Consultations
219 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More