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

Authors:
Nikhil Bansal
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Venue:
Operations Research Letters
Year:
2003

Citing 7
Cited 7

Approximation with generalized hyperexponential distributions: weak convergence

Queueing Systems: Theory and Applications
Processor-sharing queues: some progress in analysis

Queueing Systems: Theory and Applications
Response time distribution in a multiprogrammed computer with terminal traffic

Performance Evaluation
Time-shared Systems: a theoretical treatment

Journal of the ACM (JACM)
Sojourn time asymptotics in the M/G/1 processor sharing queue

Queueing Systems: Theory and Applications
The M/G/1 Processor-Sharing Queue with Bulk Arrivals

Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Distribution Estimation Using Laplace Transforms

INFORMS Journal on Computing

Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling

Queueing Systems: Theory and Applications
A sample path relation for the sojourn times in G/G/1-PS systems and its applications

Queueing Systems: Theory and Applications
The processor-sharing queue with bulk arrivals and phase-type services

Performance Evaluation
Processor sharing: A survey of the mathematical theory

Automation and Remote Control
Simulation model driven performance evaluation for enterprise applications

Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
Batch processor sharing with hyper-exponential service time

Operations Research Letters
Sojourn times in a processor sharing queue with multiple vacations

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the single server processor-sharing queue for the case of bulk arrivals. We obtain an expression for the expected response time of a job as a function of its size, when the service times of jobs have a generalized hyperexponential distribution and more generally for distributions with rational Laplace transforms. Our analysis significantly extends the class of distributions for which processor-sharing queues with bulk arrivals were previously analyzed.