Analysis of the M/G/1 processor-sharing queue with bulk arrivals

DOI10.1016/S0167-6377(03)00029-4MaRDI QIDQ1400352zbMATH OpenFDO

Authors N. Bansal

Publication date 13 August 2003

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-6377(03)00029-4

zbMATH Keywords

processor-sharingqueueing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

An M/G/1 processor-sharing queue is investigated. The emphasis is put on the calculation of the expected response time of a job as a function of its size. This is done in the cases when the job size follows a generalized hyperexponential distribution and, more generally, a distribution with rational Laplace transform.

Recommendations

• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• scientific article; zbMATH DE number 1222144
• scientific article; zbMATH DE number 3943021
• Processor-sharing queues: Some progress in analysis
• Batch processor sharing with hyper-exponential service time

Cites work

• A benchmark for ph estimation algorithms: results for acyclic-ph
• A Functional Equation Arising in a Queue With a Gating Mechanism
• A new approach to the M/G/1 processor-sharing queue
• An Approximation Method for the Analysis of GI/G/1 Queues
• Approximation with generalized hyperexponential distributions: Weak convergence results
• scientific article; zbMATH DE number 3113174 (Why is no real title available?)
• scientific article; zbMATH DE number 3823138 (Why is no real title available?)
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• Processor-sharing queues: Some progress in analysis
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Time-shared Systems

Cited in

(19)

• Processor-sharing queues: Some progress in analysis
• A solution for the \(M^ X/G/1\)-PS process response time
• An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue
• Response times in gated M/G/1 queues: The processor-sharing case
• A Matlab toolkit for the analysis of two-level processor sharing queues
• Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
• A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Using the M/G/1 queue under processor sharing for exact simulation of queues
• A Unified Framework for the Analysis of M/G/1 Queue Controlled by Workload
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue
• Sojourn times in a processor sharing queue with multiple vacations
• scientific article; zbMATH DE number 1222144 (Why is no real title available?)
• Batch sojourn time in the \(M^{[X]}/M/1\) processor sharing queue with geometric batch size
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Asymptotic analysis of the sojourn time of a batch in a M ^{[ X ]} / M /1 processor sharing queue
• Optimal choice of threshold in two level processor sharing
• Processor sharing: a survey of the mathematical theory
• Batch processor sharing with hyper-exponential service time

This page was built for publication: Analysis of the M/G/1 processor-sharing queue with bulk arrivals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400352)