Computation of availability of a real-time system using queueing theory methodology

J. Kreimer, A. Mehrez

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

In this paper we consider a real-time multiserver (such as machine controllers) and multichannel (such as regions and assembly lines) systems involving maintenance. Our objective is to fit these systems into the framework of queueing models and thus to justify the use of the powerful queueing theory analytical methods in the analysis of real-time systems. The main difficulty is that real-time systems by their very nature do not permit queues. To resolve this contradiction we use a dual approach in which we consider jobs as servers and servers as jobs. We adjust the traditional definition of availability for the real-time systems under consideration and show how to compute the system’s availability, when both service and maintenance times are exponentially distributed (birth-and-death process). At this stage we restrict ourselves to a worst case (maximum load regime), which is most typical in high-performance data acquisition and control (production and military) systems.

Original languageEnglish
Pages (from-to)1095-1100
Number of pages6
JournalJournal of the Operational Research Society
Volume49
Issue number10
DOIs
StatePublished - 1 Jan 1998

Keywords

  • Availability
  • Maintenance
  • Production control
  • Real-time data processing
  • Unmanned systems

Fingerprint

Dive into the research topics of 'Computation of availability of a real-time system using queueing theory methodology'. Together they form a unique fingerprint.

Cite this