Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
The performance of a disk system is often measured in terms of the length of the waiting line or queue of requests for each of the system's spindles. Thus it is natural to formulate and analyze queueing models of disk systems. While most disk systems have certain characteristics, such as channel interference and concurrent seeks, in common, previous analyses have always been begun from scratch, without exploiting this commonality. We introduce a general queueing model for disk systems, which incorporates the characteristics common to most disk systems, and use it in the approximate analyses of models of the IBM 2314 and 3330 disk systems. Comparisons with simulation statistics show that the approximations made are very good over a wide range of arrival rates and system parameters. We also show how to use the analytic results to investigate performance differences between devices.
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Jan 1, 1977
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.