Issue No. 11 - November (2003 vol. 52)

ISSN: 0018-9340

pp: 1407-1420

ABSTRACT

<p><b>Abstract</b>—We derive the guaranteed throughput of a multizone disk that repeatedly handles batches of <tmath>n</tmath> 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 <tmath>n</tmath> 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 <tmath>{\cal{O}}(z_{\max}^3 n^2)</tmath> time, where <tmath>z_{\max}</tmath> is the number of zones of the disk.</p>

INDEX TERMS

Guaranteed throughput, multizone disk, worst-case analysis.

CITATION

J. Korst, W. Michiels and J. Aerts, "On the Guaranteed Throughput of Multizone Disks," in

*IEEE Transactions on Computers*, vol. 52, no. , pp. 1407-1420, 2003.

doi:10.1109/TC.2003.1244939

CITATIONS