Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System (Q3730767)
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 3962931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System |
scientific article; zbMATH DE number 3962931 |
Statements
Asymptotic Analysis of the Waiting-Time Distribution for a Large Closed Processor-Sharing System (English)
0 references
1986
0 references
singular perturbations
0 references
Asymptotic approximations to the steady-state distribution
0 references
0.8745065927505493
0 references
0.8324006199836731
0 references
0.8313287496566772
0 references
0.8304924368858337
0 references
A closed queueing system with a CPU, a large number of terminals and an equal number of jobs is considered. Think times, i.e., times to generate a job, and service times are exponentially distributed. Asymptotic approximations to the steady-state distribution of the waiting time are determined. Of special interest to the author are the cases of heavy usage (\(\rho\) close to one) and very heavy usage (\(\rho\) somewhat larger than one). The derivations are mathematically complicated and cumbersome. The nice paper seems to be mainly of academic interest.
0 references