|
Degree
|
Student of Faculty of Mathematics Petrozavodsk State University
|
|
E-mail
|
xitushka@gmail.com
|
|
Location
|
Petrozavodsk
|
|
Articles
|
This article analyzes the presentation method of the two FIFO-queues in the memory of size m units. It is assumed that on the odd step inserting items into one of the queues while on the even step deleting items from the queues are allowed. Considering the known probability of operations, we solve the problem of shared memory optimal partitioning between queues in the case of consecutive cyclic representation of queues. The optimality criterion is considered as a minimum percentage of lost items at infinite time of the queue.
Read more...
|
