Referenced Items are not available for this document.
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.
Published in:
Computers, IEEE Transactions on
(Volume:C-17
,
Issue:
6
)
Date of Publication: June 1968
- Page(s):
- 600 - 603
- ISSN :
- 0018-9340
- Digital Object Identifier :
- 10.1109/TC.1968.227425
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 September 2006
- Issue Date :
- June 1968
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
