J. Blieberger, U. Schmid:

"FCFS Scheduling in a Hard Real-Time Environment under Rush-Hour Conditions";

BIT Numerical Mathematics,32(1992), 3; 370 - 383.

We investigate some real-time behaviour

of a (discrete time) single server system with FCFS (first come first serve)

task scheduling under rush-hour conditions.

The main result deals with the probability

distribution of a random variable SRD(T), which describes the time the

system operates without violating a fixed task service time deadline T.

Relying on a simple general probability model, asymptotic formulae

concerning the mean and the variance of SRD(T) are determined;

for instance,

if the average arrival rate is larger than the departure rate,

the expectation of SRD(T) is proved to fulfill

E[SRD(T)] = c_{1}+ O(T^{-3}) for T to infinity,

where c_{1}denotes some constant.

If the arrival rate equals the departure rate, we find

E[SRD(T)] = c_{2}T^{i}for some i greater or equal 2.

http://dx.doi.org/10.1007/BF02074875

Created from the Publication Database of the Vienna University of Technology.