The Community for Technology Leaders
Green Image
Abstract?A particular method for storage of first-in-first-out queues in random access memory is analyzed. The storage scheme gives minimum overhead costs at the expense of storage utilization. The resulting queue is analyzed as a Markov chain and the stationary, joint probability distribution is obtained for the queue length and the relative location of the head of the queue. Expressions for the mean length and the locations of the head and the tail of the queue are also derived.
Index Terms?Markov models of storage allocation, probability models of queue storage, queue storage, storage allocation.

E. Coffman and A. McKellar, "On the Motion of an Unbounded, Markov Queue in Random Access Storage," in IEEE Transactions on Computers, vol. 17, no. , pp. 600-603, 1968.
161 ms
(Ver 3.3 (11022016))