Derives recursive Laplace transform for response time distribution in M/G/1 preemptive priority with stochastic preemption overhead and introduces job joint transform for general overhead models.
Boxma and Bert Zwart
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.PF 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Introduces γ-CounterBoost policy that minimizes response time tail using only job types (no arrival times) in light-tailed M/G/1 queues for d≥2 types, extending Nudge-M.
citing papers explorer
-
Priority Scheduling in the M/G/1 with Preemption Overhead
Derives recursive Laplace transform for response time distribution in M/G/1 preemptive priority with stochastic preemption overhead and introduces job joint transform for general overhead models.
-
$\gamma$-CounterBoost: Optimizing response time tails using job type information only
Introduces γ-CounterBoost policy that minimizes response time tail using only job types (no arrival times) in light-tailed M/G/1 queues for d≥2 types, extending Nudge-M.