Hostname: page-component-84b7d79bbc-g5fl4 Total loading time: 0 Render date: 2024-07-25T13:48:16.250Z Has data issue: false hasContentIssue false
  • English
  • Français

The completion time of a job on multimode systems

Published online by Cambridge University Press:  01 July 2016

V. G. Kulkarni ,
V. F. Nicola  and
K. S. Trivedi
V. G. Kulkarni*
Affiliation:
University of North Carolina, Chapel Hill
V. F. Nicola*
Affiliation:
University of North Carolina, Chapel Hill
K. S. Trivedi*
Affiliation:
Duke University
*
∗Postal address: Department of Operations Research, University of North Carolina, Chapel Hill, NC 27514, USA.
∗∗Postal address: Department of Computer Science, Duke University, Durham, NC 27706, USA.
∗∗Postal address: Department of Computer Science, Duke University, Durham, NC 27706, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

SEMI-MARKOV CHAINSPERFORMANCE OF MULTISTATE COMPUTER SYSTEMSFAILURE–REPAIR MODELSPRE-EMPTIONSJOB COMPLETION
Type
Research Article
Information
Advances in Applied Probability , Volume 19 , Issue 4 , December 1987 , pp. 932 - 954
Copyright
Copyright © Applied Probability Trust 1987 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Research supported in part by the Air Force Office of Scientific Research under grants AFOSR-86–0132 and AFOSR-84–0140, by the Army Research Office under contract DAAG29–84–0045 and by the National Science Foundation under grant MCS-830200.

References

[1] Baccelli, F. and Trivedi, K. S. (1983) Analysis of M/G/2-standby redundant system. Performance '83, ed. Agrawala, A. K. and Tripathi, S. K., North-Holland, Amsterdam, 457–476.Google Scholar
[2] Castillo, X. and Siewiorek, D. P. (1980) A performance-reliability model for computing Systems. Proc. 1980 Int. Symp. on Fault-Tolerant Computing , Kyoto, 187–192.Google Scholar
[3] Coffman, W. G. Jr., Muntz, R. R. and Trotter, H. (1970) Waiting time distributions for processor-sharing systems. J. Assoc. Comput. Mach. 17, 123–130.CrossRefGoogle Scholar
[4] Gaver, D. P. (1962) A waiting line with interrupted service, including priorities. J. R. Statist. Soc. B24, 73–90.Google Scholar
[5] Kulkarni, V. G., Nicola, V. F. and Trivedi, K. S. (1986) On modeling the performance and reliability of multi-mode computer systems. J. Systems and Software 6, 175–182.CrossRefGoogle Scholar
[6] Kulkarni, V. G., Nicola, V. F., Smith, R. M. and Trivedi, K. S. (1986) Numerical evaluation of performability measures and job completion time in repairable fault-tolerant systems. Proc. IEEE Symp. Fault-Tolerant Computing, Vienna.Google Scholar
[7] Naylor, A. W. and Sell, G. R. (1971) Linear Operator Theory. Holt, Reinhart and Winston, New York.Google Scholar
[8] Nicola, V. F. (1986) A single server queue with mixed types of interruptions. Acta Informatica 23, 465–486.CrossRefGoogle Scholar
[9] Nicola, V. F., Kulkarni, V. G. and Trivedi, K. S. (1987) Queuing analysis of fault-tolerant computer systems. IEEE Trans. Software Engineering 13, 363–375.CrossRefGoogle Scholar
[10] Puri, P. S. (1971) A method for studying the integral functionals of stochastic processes with applications: I. Markov chain case. J. Appl. Prob. 8, 331–343.CrossRefGoogle Scholar