Modeling of priorityless processing in an interleaved memory with a perfectly informed processor (Q1067784)
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: Modeling of priorityless processing in an interleaved memory with a perfectly informed processor |
scientific article; zbMATH DE number 3930343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Modeling of priorityless processing in an interleaved memory with a perfectly informed processor |
scientific article; zbMATH DE number 3930343 |
Statements
Modeling of priorityless processing in an interleaved memory with a perfectly informed processor (English)
0 references
1985
0 references
We consider a mathematical model of priorityless queue processing under complete information for the case of two queues with customers of two types. A method is proposed for designing a polynomial optimal algorithm. The service speed is introduced, its existence is proved, and some bounds for the case of equiprobable customers are given.
0 references
queueing
0 references
priorityless queue processing
0 references
complete information
0 references
polynomial optimal algorithm
0 references
service speed
0 references
0.85789466
0 references
0.83784616
0 references
0.83609354
0 references
0.8316285
0 references
