On the M/G/1 foreground-background processor-sharing queue (Q1825530)
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 4121175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the M/G/1 foreground-background processor-sharing queue |
scientific article; zbMATH DE number 4121175 |
Statements
On the M/G/1 foreground-background processor-sharing queue (English)
0 references
1989
0 references
The authors give a new derivation of the distribution of the equilibrium system state of a service system with Poisson batch arrivals and general service time requirement distribution. The discipline is such that customers whose attained service is x units receive service only when no customers are present with smaller attained service. Those present with least attained service receive service at a rate inversely proportional to their number. The application of the model is to processor-sharing systems.
0 references
equilibrium system state
0 references
service system with Poisson batch arrivals
0 references
processor-sharing systems
0 references
0 references
0.89041895
0 references
0.8879565
0 references
0.8840109
0 references
0.8717629
0 references
0.87096465
0 references
0.8705411
0 references
0.8669616
0 references
