Waiting time estimates for programs in a computer with limited resources (Q1115588)
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: Waiting time estimates for programs in a computer with limited resources |
scientific article; zbMATH DE number 4087005
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Waiting time estimates for programs in a computer with limited resources |
scientific article; zbMATH DE number 4087005 |
Statements
Waiting time estimates for programs in a computer with limited resources (English)
0 references
1988
0 references
We propose a method of approximate estimation of the mean waiting time of a program to begin executing on a time-shared computer with limited resources (such as memory, files, number of service sites) and collisions between competing programs. The method has been implemented on a computer. In an analytically testable case, the approximate estimate approaches the theoretical estimate for high computer loads.
0 references
\(M_ N/M_ N/S/\infty\) queueing system
0 references
mean waiting time
0 references
