Data access time is an important performance measure for any mass data storage system. It is the time between a data request received by the data storage system and the last bit of requested data sent to the host. For a magnetic hard disk drive, its data access time depends on how fast the actuator moves from tracks to tracks, the rotational speed of the platter, the size of the buffer for storing requests and data, and the algorithm that schedules the data requests. To improve the data access time, designers need to consider these parameters and perform trade-offs. This paper considers this problem. We derive analytical relations that are useful for design trade-offs.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.