Computing Publications

Publications Home » Semi-blind scheduling in a finite...

Semi-blind scheduling in a finite capacity system

Nigel Thomas, Jeremy T. Bradley, William J. Knottenbelt

National Workshop Paper
UKPEW'04, 20th Annual UK Performance Evaluation Workshop
July, 2004

In this paper a class of queueing model is studied where servers break down but the information regarding breakdowns is not immediately available. As such, jobs continue to arrive into a queue for some period after service has ceased. These queues have finite capacity, therefore there is also the possibility that queues become full causing job-loss. The effect of the duration of any delay on information propagation on the system response time and job loss is investigated and evaluated numerically.


A more comprehensive version of this work appeared in IEE Software:

PDF of full publication (138 kilobytes)
(need help viewing PDF files?)
GZipped Postscript of full publication (230 kilobytes)
(need help viewing GZipped Postscript files?)
BibTEX file for the publication
Conditions for downloading publications from this site. built & maintained by Ashok Argent-Katwala.