|Title:||A Class of Fifo Queues Arising in Computer Systems
|Authors:||Edward G. Coffman and Micha Hofri
|Abstract:||Secondary memory devices are modeled as single server queueing 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 Markqv chain, which are an approximation of reality. Alternative computational procedures and closed expressions are given for queue length, waiting times (and device utilization). Some special izations, to disks and drums are presented. Only FIFO service is considered.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1976/CS/CS0087), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1976
To the main CS technical reports page
Computer science department, Technion