Analysis of the M/G/1 processor-sharing queue with bulk arrivals (Q1400352)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1963726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis of the M/G/1 processor-sharing queue with bulk arrivals |
scientific article; zbMATH DE number 1963726 |
Statements
Analysis of the M/G/1 processor-sharing queue with bulk arrivals (English)
0 references
13 August 2003
0 references
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.
0 references
queueing
0 references
processor-sharing
0 references
0 references
0 references
0.8605220913887024
0 references
0.8498770594596863
0 references
0.844628632068634
0 references
