MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES
From MaRDI portal
Publication:5242837
DOI10.1017/S0269964817000286zbMath1423.90061OpenAlexW2735446932MaRDI QIDQ5242837
Publication date: 7 November 2019
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964817000286
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Multi-server queueing systems with multiple priority classes
- Analysis of nonpreemptive priority queues with multiple servers and two priority classes
- Modeling a Multiprocessor System with Preemptive Priorities
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- Analysis of a non-preemptive priority multiserver queue
- Multiprocessor systems with preemptive priorities
- On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
- Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue
- Probabilistic Modelling
This page was built for publication: MULTI-CLASS RESOURCE SHARING WITH PREEMPTIVE PRIORITIES