A single server queue in a hard-real-time environment

DOI10.1016/0167-6377(85)90023-9MaRDI QIDQ1063338zbMATH OpenOpenAlexFDO

Authors Kishor S. Trivedi, Francois Baccelli

Publication date 1985

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6377(85)90023-9

zbMATH Keywords

analytical characterization of the transient behaviorqueues with breakdownreal-time systemsreliability of computer systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Review text

We consider a single server first in first out queue in which each arriving task has to be completed within a certain period of time (its deadline). More precisely, each arriving task has its own deadline - a non-negative real number - and as soon as the response time of one task exceeds its deadline, the whole system is considered to have failed. (In that sense the deadline is hard.) The main practical motivation for analyzing such queues comes from the need to evaluate mathematically the reliability of computer systems working with real time constraints (space or aircraft systems for instance). We shall therefore be mainly concerned with the analytical characterization of the transient behavior of such a queue in order to determine the probability of meeting all hard deadlines during a finite period of time (the mission time). The probabilistic methods for analyzing such systems are suggested by earlier work on impatience in telecommunication systems [see e.g. the first author, \textit{P. Boyer} and \textit{G. Hebuterne}, Adv. Appl. Probab. 16, 887-905 (1984; Zbl 0549.60091)].

Recommendations

• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• On stability of queueing networks with job deadlines
• Some investigations on FCFS scheduling in hard real time applications
• On queueing with customer impatience until the beginning of service
• Accuracy of state space collapse for earliest-deadline-first queues

Cites work

• A Many-Server Queue with Service Interruptions
• scientific article; zbMATH DE number 3177123 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• Single-server queues with impatient customers

Cited in

(5)

• Real-time system with homogeneous servers and nonidentical channels in steady-state
• On a single-server queue with multiple transaction
• Queues with interruptions: a survey
• On a single server queueing inventory system
• A closed queuing network model with single servers for multi-threaded architecture

This page was built for publication: A single server queue in a hard-real-time environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1063338)