By Topic

On the guaranteed throughput of multizone disks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Michiels, W. ; Philips Res. Labs., Eindhoven, Netherlands ; Korst, J. ; Aerts, J.

We derive the guaranteed throughput of a multizone disk that repeatedly handles batches of n requests of constant size. Using this guaranteed throughput in the design of multimedia systems, one can admit more streams or get smaller buffer requirements and guaranteed response times than when an existing lower bound is used. We consider the case that nothing can be assumed about the location of the requests on the disk. Furthermore, we assume that successive batches are handled one after the other, where the n requests in a batch are retrieved using a SCAN-based sweep strategy. We show that we only have to consider two successive batches to determine the guaranteed throughput. Using this, we can compute the guaranteed throughput by determining a maximum-weighted path in a directed acyclic graph in O(zmax3n2) time, where zmax is the number of zones of the disk.

Published in:

Computers, IEEE Transactions on  (Volume:52 ,  Issue: 11 )