Topics
algorithmMusic genre
Abstract. Restart is an application-level technique that speeds up jobs with highly variable completion times. In this paper, we present an efficient iterative algorithm to determine the restart strategy that minimises higher moments of completion time, when the total number of restarts is finite. We demonstrate its computational efficiency in comparison with alternative algorithms. We also discuss fast approximations to determine close to optimal restart times for limiting cases.
Abstract Restart techniques for randomizing complete search algorithms were proposed recently by Sel...
Since the last decade, computing systems turn to large scale parallel platforms composed of thousand...
Checkpointing is commonly adopted for enhancing the performance of software applications that operat...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
International audienceThis work provides an optimal checkpointing strategy to protect iterative appl...
This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enable...
We apply the known formulae of the RESTART problem to Markov models of software (and many other) sys...
Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algo...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically res...
We study programs which operate in the presence of possible failures and which must be restarted fro...
This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enables...
In this paper I describe experiments in the application of dynamic restarts used in heuristic satisf...
Abstract Restart techniques for randomizing complete search algorithms were proposed recently by Sel...
Since the last decade, computing systems turn to large scale parallel platforms composed of thousand...
Checkpointing is commonly adopted for enhancing the performance of software applications that operat...
We give an algorithm to minimize the total completion time on-line on a single machine, using restar...
International audienceThis work provides an optimal checkpointing strategy to protect iterative appl...
This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enable...
We apply the known formulae of the RESTART problem to Markov models of software (and many other) sys...
Let A be any fixed cut-off restart algorithm running in parallel on multiple processors. If the algo...
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically res...
We study programs which operate in the presence of possible failures and which must be restarted fro...
This paper revisits replication coupled with checkpointing for fail-stop errors. Replication enables...
In this paper I describe experiments in the application of dynamic restarts used in heuristic satisf...
Abstract Restart techniques for randomizing complete search algorithms were proposed recently by Sel...
Since the last decade, computing systems turn to large scale parallel platforms composed of thousand...
Checkpointing is commonly adopted for enhancing the performance of software applications that operat...
Add to ORKG