Running a job on a collection of dynamic machines, with on-line restarts

R. Stee, van, J.A. Poutré, la

Research output: Contribution to journalArticleAcademicpeer-review

4 Downloads (Pure)

Abstract

We consider the problem of running a background job on a selected machine of a collection of machines. Each of these machines may become temporarily unavailable (busy) without warning. If the currently selected machine becomes unavailable, the scheduler is allowed to restart the job on a different machine. The behaviour of machines is characterized by a Markov chain, which can be compared to [6]. The objective is to minimize the expected completion time of the job. For several types of Markov chains, we present elegant and optimal policies.
Original languageEnglish
Pages (from-to)727-742
Number of pages16
JournalActa Informatica
Volume37
Issue number10
DOIs
Publication statusPublished - 2001

Fingerprint Dive into the research topics of 'Running a job on a collection of dynamic machines, with on-line restarts'. Together they form a unique fingerprint.

Cite this