The M/G/1 processor-sharing queue with disasters
From MaRDI portal
The \(M/G/1\) processor-sharing queue with disasters
Recommendations
- A note on application of the method of supplementary variables to the analysis of a processor sharing system
- Stationary and transient analysis of M/M/1 G-queues
- ANALYSIS OF M/G/1 STOCHASTIC CLEARING SYSTEMS
- A Pollaczek–Khintchine formula for M/G/1 queues with disasters
- The M/G/1 processor-sharing model: Transient behavior
Cites work
- GI/G/1 processor sharing queue in heavy traffic
- \(G\)-networks: A versatile approach for work removal in queueing networks
- A BMAP/SM/1 queueing system with Markovian arrival input of disasters
- A MAP/G/1 queue with negative customers
- A new approach to the M/G/1 processor-sharing queue
- A Pollaczek–Khintchine formula for M/G/1 queues with disasters
- An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- Analysis of A time‐shared processor
- Computation of the limiting distribution in queueing systems with repeated attempts and disasters
- Conditional response times in the M/G/1 processor-sharing system
- scientific article; zbMATH DE number 3823138 (Why is no real title available?)
- scientific article; zbMATH DE number 3943021 (Why is no real title available?)
- scientific article; zbMATH DE number 3716546 (Why is no real title available?)
- scientific article; zbMATH DE number 1324228 (Why is no real title available?)
- Mathematical problems in the theory of processor-sharing queueing systems
- On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
- Processor-sharing queues: Some progress in analysis
- Product-form queueing networks with negative and positive customers
- Response times in gated M/G/1 queues: The processor-sharing case
- Response-Time Distribution for a Processor-Sharing System
- Sojourn time asymptotics in the M/G/1 processor sharing queue
- Sojourn time distribution in a MAP/M/1 processor-sharing queue
- SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
- The M/G/1 processor sharing queue as the almost sure limit of feedback queues
- The M/G/1 queue with negative customers
- The gi/m/1 processor-sharing queue and its heavy traffic analysis
- The M/G/1 processor-sharing model: Transient behavior
- The sojourn time in the GI/M/1 queue by processor sharing
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Time-shared Systems
- Waiting Time Distributions for Processor-Sharing Systems
Cited in
(14)- A note on application of the method of supplementary variables to the analysis of a processor sharing system
- Analysis of the M/G/1 queue in multi-phase random environment with disasters
- The \(N\)-policy for an unreliable server with delaying repair and two phases of service
- A Pollaczek–Khintchine formula for M/G/1 queues with disasters
- Using the M/G/1 queue under processor sharing for exact simulation of queues
- A batch arrival unreliable server Bernoulli vacation queue with two phases of service and delayed repair
- ANALYSIS OF M/G/1 STOCHASTIC CLEARING SYSTEMS
- PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION
- Insensitivity of the mean field limit of loss systems under \(\mathrm{SQ}(d)\) routeing
- Clearing models for \(M/G/1\) queues
- The optimal control of an unreliable server queue with two phases of service and Bernoulli vacation schedule
- Mathematical analysis on production control in manufacturing units under disaster and repair with compulsory vacation
- On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes
- An M/G/1 queue with two phases of service subject to the server breakdown and delayed repair
This page was built for publication: The \(M/G/1\) processor-sharing queue with disasters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2475887)
