Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×

Online ordering will be unavailable from 17:00 GMT on Friday, April 25 until 17:00 GMT on Sunday, April 27 due to maintenance. We apologise for the inconvenience.

  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • The completion time of a job on multimode systems

  • V. G. Kulkarni, V. F. Nicola, K. S. Trivedi
  • Journal:
    Advances in Applied Probability / Volume 19 / Issue 4 / December 1987
    Published online by Cambridge University Press:
    01 July 2016, pp. 932-954
    Print publication:
    December 1987

  • In this paper we present a general model of the completion time of a single job on a computer system whose state changes according to a semi-Markov process with possibly infinite state-space. When the state of the system changes the job service is preempted. The job service is then resumed or restarted (with or without resampling) in the new state at, possibly, a different service rate. Different types of preemption disciplines are allowed in the model. Successive aggregation and transform techniques are used to obtain the Laplace–Stieltjes transform of the job completion time. We specialize to the case of Markovian structure-state process. We demonstrate the use of the techniques developed here by means of two applications. In the first we derive the distribution of the response time in an M/M/1 queueing system under the processor-sharing discipline (PS). In the second we derive the distribution of the completion time of a job when executed on a system subject to mixed types of breakdowns and repair.