Summary
In this paper it is demonstrated how with simple techniques it is possible to obtain insight into the effects of minor hardware alterations on the behaviour of a central computing facility. In the case described here the disks and disk control units formed the bottleneck. However, the only allowable alterations were in core size and central processor speed. The practical solution was to use such alterations in such a way that seek overlap was exploited as good as possible.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. M. Chandy, C. H. Sauer, Approximate methods for analyzing queueing network models of computer systems. Comput. Surveys, 10, (1978), 282–317.
P. J. Denning, J. P. Buzen, The operational analysis of queueing network models. Comput. Surveys, 10, (1978), 225–261.
D. Hunter, Modelling real DASD configurations. This volume.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer Science+Business Media New York
About this chapter
Cite this chapter
Geilleit, R.A., Wessels, J. (1982). Exploiting Seek Overlap. In: Disney, R.L., Ott, T.J. (eds) Applied Probability— Computer Science: The Interface. Progress in Computer Science, vol 3. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-5798-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5798-1_10
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3093-5
Online ISBN: 978-1-4612-5798-1
eBook Packages: Springer Book Archive