Selection of queue discipline with the aid of minimax criterion (Q759638)
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 3882177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Selection of queue discipline with the aid of minimax criterion |
scientific article; zbMATH DE number 3882177 |
Statements
Selection of queue discipline with the aid of minimax criterion (English)
0 references
1984
0 references
The allocation of the flows of calls in accordance with the resources of a central processor of a computer system is formulated as a problem of search for a minimax-optimal queue discipline in a queuing system with several flows of calls. An efficient priority assignment algorithm is proposed and substantiated. The properties of an optimal discipline are examined.
0 references
multicriterion optimization
0 references
allocation of the flows of calls
0 references
central processor
0 references
minimax-optimal queue discipline
0 references
priority assignment algorithm
0 references
0.8135479092597961
0 references
0.80543452501297
0 references
0.8019756078720093
0 references
0.7964699268341064
0 references
