Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algorithm is only allowed to run for up to time D, then it is no longer guaranteed that a result can be found. In this case, the probability of finding a solution within the time D becomes a measure for the quality of the algorithm. In this paper we address this issue and provide upper and lower bounds for the probability of A finding a solution before a deadline passes under varying assumptions. We also show that the optimal restart times for a fixed cut-off algorithm running in parallel is identical for the optimal restart times for the algorithm running on a single processor. Finally, we conclude that the odds of finding a solution scale super...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically res...
When a deterministic algorithm for finding the minimum of a function C on a set Ω is em-ployed it ma...
We present lower bounds for time needed to solve basic problems on three general-purpose models of p...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
The way the processes in a parallel program are scheduled on the processors of a multiprocessor syst...
Abstract. Restart is an application-level technique that speeds up jobs with highly variable complet...
Since the last decade, computing systems turn to large scale parallel platforms composed of thousand...
Restart strategies are commonly used for minimizing the computational cost of randomized algorithms,...
This thesis consists of two parts: performance bounds for scheduling algorithms for parallel program...
International audienceThis work provides an analysis of checkpointing strategies for minimizing expe...
International audienceThe parallel computing platforms available today are increasingly larger and t...
We consider the following scheduling problem. The input is a set of jobs with equal processing time...
We consider the problem of sequencing m copies of unreliable jobs (i.e., jobs that have a certain pr...
Abstract We present lower bounds for time needed to solve basic problems on three general-purpose mo...
The problem of scheduling jobs that arrive over time on a single machine is well-studied. We study t...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically res...
When a deterministic algorithm for finding the minimum of a function C on a set Ω is em-ployed it ma...
We present lower bounds for time needed to solve basic problems on three general-purpose models of p...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
The way the processes in a parallel program are scheduled on the processors of a multiprocessor syst...
Abstract. Restart is an application-level technique that speeds up jobs with highly variable complet...
Since the last decade, computing systems turn to large scale parallel platforms composed of thousand...
Restart strategies are commonly used for minimizing the computational cost of randomized algorithms,...
This thesis consists of two parts: performance bounds for scheduling algorithms for parallel program...
International audienceThis work provides an analysis of checkpointing strategies for minimizing expe...
International audienceThe parallel computing platforms available today are increasingly larger and t...
We consider the following scheduling problem. The input is a set of jobs with equal processing time...
We consider the problem of sequencing m copies of unreliable jobs (i.e., jobs that have a certain pr...
Abstract We present lower bounds for time needed to solve basic problems on three general-purpose mo...
The problem of scheduling jobs that arrive over time on a single machine is well-studied. We study t...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically res...
When a deterministic algorithm for finding the minimum of a function C on a set Ω is em-ployed it ma...
We present lower bounds for time needed to solve basic problems on three general-purpose models of p...