On the M/G/1 foreground-background processor-sharing queue
From MaRDI portal
Recommendations
- The \(\text{BMAP}/\text{G}/1/\infty\) queue with the foreground-background processor-sharing discipline
- The M/G/1 queue with processor sharing and its relation to a feedback queue
- A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
- A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline
- Processor-sharing queues: Some progress in analysis
- Using the M/G/1 queue under processor sharing for exact simulation of queues
- The gi/m/1 processor-sharing queue and its heavy traffic analysis
- On the transient behavior of the processor sharing queue
- The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
Cites work
- scientific article; zbMATH DE number 3913667 (Why is no real title available?)
- Processor-sharing queues: Some progress in analysis
- Sur les mesures de Palm de deux processus ponctuels stationnaires
- The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
Cited in
(4)- Batch processor sharing with hyper-exponential service time
- A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline
- scientific article; zbMATH DE number 3932753 (Why is no real title available?)
- Mathematical problems in the theory of processor-sharing queueing systems
This page was built for publication: On the M/G/1 foreground-background processor-sharing queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825530)