The Circular Representation of 2 FIFO-queues in Single Level Memory.

This paper presents mathematical models and algorithms of optimal control of 2 FIFO-queues in the memory of one level where the queues are moving one after another in a circle. As mathematical models we propose random walks on the integer lattice in different areas in 3-dimensional space. Optimality criterions are the average working time. [ABSTRACT FROM AUTHOR]