A computer and communications network performance analysis primer
A computer and communications network performance analysis primer
Numerical analysis: 4th ed
The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
Analysis of transmission delay for a structured-priority packet-switching system
Computer Networks and ISDN Systems
Computer Performance Modeling Handbook
Computer Performance Modeling Handbook
Threshold-based interventions to optimize performance in preemptive priority queues
Queueing Systems: Theory and Applications
Reducing Delay in Preemptive Repeat Priority Queues
Operations Research
A data base replication analysis using an M/M/m queue with service interruptions
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
(N,n)-preemptive priority queues
Performance Evaluation
Computers and Operations Research
| Hi-index | 0.00 |
This paper introduces a new variant of the classical preemptive resume priority queue, in which the partially rendered service of an interrupted task is retained only if the time spent serving the higher priority work falls below a specified threshold. Both preemptive repeat-different (RD) and preemptive repeat-identical (RI) strategies are considered in the event that service is to start over. The Laplace-Stieltjes transforms (LSTs) of the waiting time and flow time distributions are derived for each class. Using a recursive procedure to derive the moments of interruption times, the first two moments of the waiting time and flow time are also obtained. The results are then applied to two numerical examples.