Analysis of a threshold-based priority queue
From MaRDI portal
Cites work
- A note on the discretization of Little's result
- A preemptive repeat priority queue with resampling: performance analysis
- A semi-preemptive priority scheduling discipline: performance analysis
- Analysis of a discrete-time preemptive resume priority buffer
- Analysis of a discrete-time queue with time-limited overtake priority
- Asymptotics of waiting time distributions in the accumulating priority queue
- Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node
- Delay analysis of multiclass queues with correlated train arrivals and a hybrid priority/FIFO scheduling discipline
- Frame-bound priority scheduling in discrete-time queueing systems
- scientific article; zbMATH DE number 1966261 (Why is no real title available?)
- scientific article; zbMATH DE number 836618 (Why is no real title available?)
- Little's Law as viewed on its 50th anniversary
- On the three-queue priority polling system with threshold service policy
- Performance analysis of a single-server ATM queue with a priority scheduling.
- Performance comparison of several priority schemes with priority jumps
- Priority queueing model with changeover times and switching threshold
- The discrete-time preemptive repeat identical priority queue
This page was built for publication: Analysis of a threshold-based priority queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000755)