Queueing Analysis of Fault-Tolerant Computer Systems.

Abstract

This paper analyzes a fault-tolerant computer system. The failure/repair behavior of the system is modeled by an irreducible continuous-time Markov chain. Jobs arrive in a Poisson fashion to the system and are serviced according to an FCFS discipline. A failure may cause the loss of the work already done on the job in service, if any; in this case the interrupted job is repeated as soon as the system is ready to deliver service. In addition to the delays due to failures and repairs, jobs suffer delays due to queueing. The authors presents a queueing analysis of fault-tolerant systems and study the steady-state behavior of the number of jobs in the system. As a numerical example, they consider a system with two processors subject to failures and repairs. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1985
Accession Number
ADA170303

Entities

People

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

Organizations

  • University of North Carolina at Chapel Hill

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Classification
  • Communication Systems
  • Computer Science
  • Computers
  • Equations
  • Markov Chains
  • Markov Processes
  • Numerical Analysis
  • Operations Research
  • Probability
  • Queueing Theory
  • Random Variables
  • Reliability
  • Steady State
  • Theorems

Fields of Study

  • Engineering

Readers

  • Logistics and Supply Chain Management.
  • Mathematical Modeling and Probability Theory.