Skip to main content
SpringerLink
Log in

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

  • Original articles
  • Published:
Acta Informatica Aims and scope Submit manuscript

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 Ma rkov chains, we present elegant and optimal policies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science (CWI), Kruislaan 413, 1098 SJ Amsterdam, The Netherlands (e-mail: {rvs,hlp}@cwi.nl) , , , , , , NL

    Rob van Stee & Han La Poutré

Authors
  1. Rob van Stee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Han La Poutré
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 31 March 1999 / 5 April 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

van Stee, R., La Poutré, H. Running a job on a collection of partly available machines, with on-line restarts. Acta Informatica 37, 727–742 (2001). https://doi.org/10.1007/PL00013305

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00013305

Keywords

Search

Navigation