A semi‐preemptive priority scheduling discipline: Performance analysis

A semi‐preemptive priority scheduling discipline: Performance analysis

0.00 Avg rating0 Votes
Article ID: iaor20126266
Volume: 224
Issue: 2
Start Page Number: 324
End Page Number: 332
Publication Date: Jan 2013
Journal: European Journal of Operational Research
Authors: , ,
Keywords: queues: applications, simulation: analysis
Abstract:

In this paper, we present an in‐depth analytical study of a semi‐preemptive priority scheduling discipline. This discipline eliminates the deficits of both the full‐ and non‐preemptive versions. Under the non‐preemptive category, in particular, higher‐priority customers may have to wait even when the service of a lower‐priority customer has just started, while under the full‐preemptive discipline, the almost completed service of a lower‐priority customer may be interrupted due to the arrival of higher‐priority customers, possibly causing a large extra delay. For fixed low‐priority service times, the semi‐preemptive priority scheduling discipline shows a performance gain of up to 6% compared to the full‐ and non‐preemptive versions.

Reviews

Required fields are marked *. Your email address will not be published.