DUAL-QUEUE SCHEDULING AND AN ENGINEERING DELAY BOUND UNDER OVERLOAD
DUAL-QUEUE SCHEDULING AND AN ENGINEERING DELAY BOUND UNDER OVERLOAD
DOI:
https://doi.org/10.46687/jsar.v31i1.506Keywords:
Dual-Queue, Delay bound, FIFO, LIFO, Starvation, One dequeAbstract
One shared queue under overload is considered. Seven of every ten extractions are taken from the tail and three from the head. An engineering upper bound on the wait of jobs removed from the head is derived for a sustained hybrid and a constant share θ. With eight servers, mean service 40 ms and a full buffer of 1000 jobs, the bound is about 16.7 s and sits above a 3 s threshold. A 10 Hz guard is therefore included in the sizing: it replaces LIFO with the hybrid when the head has waited more than 3 s. A measured P99 is not reported.
References
Harchol-Balter, M. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, 2013.
De Schepper, K., Albisser, O., Tilmans, O. & Briscoe, B. Dual queue coupled AQM: Deployable very low queuing delay for all. arXiv:2209.01078, 2022.
Downloads
Published
How to Cite
Issue
Section
Categories
License
Copyright (c) 2026 JOURNAL SCIENTIFIC AND APPLIED RESEARCH

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
https://orcid.org/0000-0003-3668-6713