The Completion Time of a Job on Multi-Mode Systems.

Abstract

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. Keywords include: Semi-Markov chains; performance of multi-state computer systems; failure-repair models; pre-emptions; job completion time.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1985
Accession Number
ADA154113

Entities

People

  • K. S. Trivedi
  • V. G. Kulkarni
  • V. Nicola

Organizations

  • Duke University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Computer Science
  • Computers
  • Contracts
  • Distribution Functions
  • Equations
  • Markov Chains
  • Markov Processes
  • Mathematical Models
  • Models
  • Probabilistic Models
  • Probability
  • Random Variables
  • Security
  • Stochastic Processes
  • Universities

Fields of Study

  • Education

Readers

  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms