Analysis of the M/G/1 processor-sharing queue with bulk arrivals (Q1400352): Difference between revisions

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.