DocumentCode :
1191104
Title :
On the Motion of an Unbounded, Markov Queue in Random Access Storage
Author :
Coffman, E.G.
Issue :
6
fYear :
1968
fDate :
6/1/1968 12:00:00 AM
Firstpage :
600
Lastpage :
603
Abstract :
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.
Keywords :
Index Terms—Markov models of storage allocation, probability models of queue storage, queue storage, storage allocation.; Automata; Costs; Equations; Mathematical model; Organisms; Probabilistic logic; Queueing analysis; Random access memory; Redundancy; Tail; Index Terms—Markov models of storage allocation, probability models of queue storage, queue storage, storage allocation.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1968.227425
Filename :
1687406
Link To Document :
بازگشت