Waiting time distributions in the preemptive accumulating priority queue
DOI10.1007/S11009-015-9476-1zbMath1360.60164OpenAlexW2308806806MaRDI QIDQ518869
Steve Drekic, Val Andrei Fajardo
Publication date: 30 March 2017
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10012/12058
Laplace-Stieltjes transformpreemptive priorityaccumulating prioritydynamic priority queuesmaximal priority process
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Controlling the workload of M/G/1 queues via the \(q\)-policy
- Waiting time distributions in the accumulating priority queue
- A delay dependent queue with preemption
- Priority queues
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Queues with Dynamic Priority Discipline
- Technical Note—A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines
- Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function
- A Dynamic Priority Queue with General Concave Priority Functions
- A Mixed Delay Dependent Queue Discipline
- Poisson Arrivals See Time Averages
- A Delay Dependent Queue without Pre-emption with General Linearly Increasing Priority Function
- Numerical Inversion of Laplace Transforms of Probability Distributions
- A delay dependent queue discipline
- Time Dependent Priority Queues
- A Continuation of Delay-Dependent Queue Disciplines
- Bounds for a Dynamic-Priority Queue
- Some problems in queueing with dynamic priorities
- Waiting‐time distributions for queues with dynamic priorities
- Level crossing methods in stochastic models
This page was built for publication: Waiting time distributions in the preemptive accumulating priority queue