A Class of FIFO Queues Arising in Computer Systems

Edward G. Coffman and Micha Hofri
Additional contact information
Edward G. Coffman: University of California, Santa Barbara, California
Micha Hofri: Technion—Israel Institute of Technology, Haifa, Israel

Operations Research, 1978, vol. 26, issue 5, 864-880

Abstract: We model secondary memory devices as single-server queuing systems. The non-random access to data within these devices is explicitly accounted for as “set-up” times. Requests are typed by the location of the desired record. No distinction is made between “read” and “write” requests. Each request is assumed to be satisfiable from one location on the device (e.g., a single directory search may result in a number of distinct requests). Requests arrive according to a homogeneous Poisson process. The types of successive requests form a first-order Markov chain, which is an approximation of reality. Alternative computational procedures and closed expressions are given for queue length, waiting times, and device utilization. We present some specializations to disks and drums. Only FIFO service is considered.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.26.5.864 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:26:y:1978:i:5:p:864-880

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().