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

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

doi:10.1007/PL00013305

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

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

Information Systems IE&IS

Research output: Contribution to journal › Article › Academic › peer-review

5 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 language	English
Pages (from-to)	727-742
Number of pages	16
Journal	Acta Informatica
Volume	37
Issue number	10
DOIs	https://doi.org/10.1007/PL00013305
Publication status	Published - 2001

Access to Document

10.1007/PL00013305

Cite this

@article{2631ea40ea7c41f2aa14f0d8aa6b3f65,

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

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.",

author = "{Stee, van}, R. and {Poutr{\'e}, la}, J.A.",

year = "2001",

doi = "10.1007/PL00013305",

language = "English",

volume = "37",

pages = "727--742",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer",

number = "10",

}

TY - JOUR

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

AU - Stee, van, R.

AU - Poutré, la, J.A.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

U2 - 10.1007/PL00013305

DO - 10.1007/PL00013305

M3 - Article

SN - 0001-5903

VL - 37

SP - 727

EP - 742

JO - Acta Informatica

JF - Acta Informatica

IS - 10

ER -

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

Abstract

Access to Document

Fingerprint

Cite this