The <i>M/G/</i>1 processor sharing queue as the almost sure limit of feedback queues (Q3350437)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The M/G/1 processor sharing queue as the almost sure limit of feedback queues |
scientific article; zbMATH DE number 4199220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The <i>M/G/</i>1 processor sharing queue as the almost sure limit of feedback queues |
scientific article; zbMATH DE number 4199220 |
Statements
The <i>M/G/</i>1 processor sharing queue as the almost sure limit of feedback queues (English)
0 references
1990
0 references
processor sharing
0 references
time sharing
0 references
customer's steady-state sojourn time distribution
0 references
performance analysis
0 references
coupling techniques
0 references
weak convergence
0 references
0.8789559006690979
0 references
0.8760020732879639
0 references
0.8726716637611389
0 references
0.8435602188110352
0 references
