a single server queue in a hard-real-time environment：硬实时环境中的单服务器队列.pdfVIP

Volume 4, Number 4 OPERATIONS RESEARCH LETTERS December 1985 A SINGLE SERVER Q U E U E IN A HARD-REAL-TIME E N V I R O N M E N T * Francois B A C C E L L I ** INRIA, Rocquencourt, 78153Le Chesnay Cedex, France Kishor S. T R I V E D I Department of ComputerScience, Duke University,Durham, NC 27706, USA Received April 1985 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 in 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 [1,2]. queues *queues with breakdown *real-time systems *transient analysis 1. Introduction In this paper, we are concerned with the analysis of a system operating in a hard-real-time environment. In such a system, each j o b (or task) must be completed within a specified period of time after a request for its execution arrives. If any j o b fails to complete w