Prediction of Parallel Speed-Ups for Las Vegas Algorithms
Authors:
- Charlotte TruchetCTCharlotte Truchet
- Florian RichouxFRFlorian Richoux
- Philippe CodognetPCPhilippe Codognet
- 1 October 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-169
Abstract
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 analyzing 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.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Parallel Local Search for the Costas Array Problem2012
- Performance analysis of parallel constraint-based local search2012
- Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron ProblemLecture Notes in Computer Science, 2010
- Explicit expressions for moments of order statisticsStatistics & Probability Letters, 2008
- Grid'5000: A Large Scale And Highly Reconfigurable Experimental Grid TestbedThe International Journal of High Performance Computing Applications, 2006
- TTT plots: a perl program to create time-to-target plotsOptimization Letters, 2006
- A review of Costas arraysJournal of Applied Mathematics, 2006
- Cooperative Parallel Variable Neighborhood Search for the p-MedianJournal of Heuristics, 2004
- Introduction to the Special Issue on Parallel Meta-HeuristicsJournal of Heuristics, 2002
- Probability Distribution of Solution Time in GRASP: An Experimental InvestigationJournal of Heuristics, 2002