The linked list representation of n LIFO-stacks and/or FIFO-queues in the single-level memory

• We build mathematical model of process of working with n FIFO-queues and LIFO-stacks.
• We consider its representation as linked lists.
• The model was constructed as n-dimensional random walk on the integer lattice in some regions of n-dimensional space.
• We use the apparatus of absorbing Markov chains.
• We calculate the average time of working until overflow.

In many applications there is a problem of representation of multiple LIFO-stacks and/or FIFO-queues in the single-level memory. This paper concerns issues related to building mathematical model of process of working with them in the case of linked list representation. This model was constructed as n-dimensional random walk on the integer lattice in some regions of n-dimensional space.