The paper contains new mathematical models concerning representation of a priority queue in single level memory as n serial FIFO queues. Proceeding from these models we propose the algorithms and programs which allow to find the optimal way of representation of a priority queue in the sense of maximizing the average time until memory overflow and in the sense of minimizing the proportion of lost elements when the probabilities are known.