Analysis of drum and disk storage units

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Many computer systems are operating significantly below the potential of their central processors because of inadequate support from the auxiliary storage units. Most storage units, e.g. drums and disks, store the information on rotating surfaces, and the delays associated with retrieving information from these devices are substantial; access times on the order of ten to one hundred milliseconds are not uncommon, while many central processors are capable of executing well over a million operations per second.Unless unusual care is taken in the organization and scheduling of these rotating storage units, they will become the dominant bottleneck in the computer system.

Author(s): Dr. Samuel H. Fuller (auth.)
Series: Lecture Notes in Computer Science 31
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1975

Language: English
Pages: 288
Tags: Computer Science, general

Introduction....Pages 1-12
An analysis of drum storage units....Pages 13-71
Performance of an I/O channel with multiple paging drums....Pages 72-107
An optimal drum scheduling algorithm....Pages 108-159
The expected difference between the SLTF and MTPT drum....Pages 160-187
Random arrivals and MTPT disk scheduling discipline....Pages 188-232
Conclusions and topics for further research....Pages 233-239