Stack-based scheduling for realtime processes
Real-Time Systems
Analysis of transmission delay for a structured-priority packet-switching system
Computer Networks and ISDN Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Reducing Delay in Preemptive Repeat Priority Queues
Operations Research
A preemptive resume queue with an expiry time for retained service
Performance Evaluation
Waiting and sojourn times in a multi-server queue with mixed priorities
Queueing Systems: Theory and Applications
(N,n)-preemptive priority queues
Performance Evaluation
Computers and Operations Research
Hi-index | 0.00 |
This paper studies a single-server priority queueing model in which preemptions are allowed during the early stages of service. Once enough service effort has been rendered, however, further preemptions are blocked. The threshold where the change occurs is either a proportion of the service requirement, or time-based. The Laplace–Stieltjes transform and mean of each class sojourn time are derived for a model which employs this hybrid preemption policy. Both preemptive resume and preemptive repeat service disciplines are considered. Numerical examples show that it is frequently the case that a good combination of preemptible and nonpreemptible service performs better than both the standard preemptive and nonpreemptive queues. In a number of these cases, the thresholds that optimize performance measures such as overall average sojourn time are determined.