A decomposition theorem and related results for the discriminatory processor sharing queue
From MaRDI portal
Publication:1342958
DOI10.1007/BF01158767zbMath0938.68543MaRDI QIDQ1342958
Bhaskar Sengupta, Kiran M. Rege
Publication date: 21 June 2000
Published in: Queueing Systems (Search for Journal in Brave)
Related Items (10)
A decomposition theorem and related results for the discriminatory processor sharing queue ⋮ Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers ⋮ Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers ⋮ Processor sharing: a survey of the mathematical theory ⋮ The use of relative priorities in optimizing the performance of a queueing system ⋮ Mean sojourn times for phase-type discriminatory processor sharing systems ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ A survey on discriminatory processor sharing ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic analysis of a large closed queueing network with discriminatory processor sharing
- Processor-sharing queues: Some progress in analysis
- The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
- Complete parameterized families of job scheduling strategies
- A decomposition theorem and related results for the discriminatory processor sharing queue
- A new approach to the M/G/1 processor-sharing queue
- Conditional response times in the M/G/1 processor-sharing system
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Sharing a Processor Among Many Job Classes
- Direct Solutions of M/G/1 Processor-Sharing Models
- Time-shared Systems
- Waiting Time Distributions for Processor-Sharing Systems
This page was built for publication: A decomposition theorem and related results for the discriminatory processor sharing queue
