Completion Time of a Job on Multi-Mode Systems

摘要

In this paper the authors 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. 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. The authors specialize to the case of Markovian state process. Finally the authors demonstrate the use of the techniques developed here by means of an application.