Optimal control of the N FIFO-queues for infinity time
Keywords:
FIFO-Queue, Linked List, Random Walk, Regular Markov’s ChainsAbstract
In this article, we research methods of the n FIFO-queues allocation in the memory of m units size. The problem of optimal memory partitioning between queues in the case of consecutive circular implementation, as well as the problem of the analysis of linked list implementation are investigated. As mathematical models, we propose random walks into different areas of the n-measured space. The tasks are solved with the help of the apparatus of regular Markov’s chains.
Published
2009-12-18
How to Cite
Aksenova, E., Sokolov, A., & Drats, A. (2009). Optimal control of the N FIFO-queues for infinity time. Information and Control Systems, (6), 46-54. Retrieved from http://proceedings.spiiras.nw.ru/index.php/ius/article/view/14901
Issue
Section
Information channels and medium