This Article 
 Bibliographic References 
 Add to: 
Comment on "Issues and Challenges in the Performance Analysis of Real Disk Arrays'
November 2005 (vol. 16 no. 11)
pp. 1103-1104

Abstract—We address an analysis of the SCAN disk scheduling, which approximates the mean seek distance as the ratio of maximum distance and disk_queue+1. We also comment on using the mean seek distance to estimate the mean disk response time.

[1] L.W. Dowdy, D.L. Eager, K.D. Gordon, and L.V. Saxton, “Throughput Concavity and Response Time Convexity,” Information Processing Letters, vol. 19, no. 4, pp. 209-212, 1984.
[2] L.W. Dowdy and K.D. Gordon, “Performance Sensitivity with Respect to the Multiprogramming Level,” Computer Systems: Science and Eng., vol. 2, no. 2, pp. 92-98, Apr. 1987.
[3] L. Kleinrock, Queueing Systems, Vol. I: Theory. John-Wiley and Sons, 1975.
[4] W.C. Oney, “Queueing Analysis of the Scan Policy for Moving-Head Disks,” J. ACM, vol. 22, no. 3, pp. 397-412, July 1975.
[5] Parallel Data Lab, “Validated Disk Parameters,” Carnegie-Mellon Univ., , 2005.
[6] A. Thomasian and C. Liu, “Empirical Performance Analysis of the SPTF Disk Scheduling Policy,” Proc. Int'l Symp. Performance Evaluation of Computer and Telecomm. System-SPECTS '04, pp. 398-401, 2004.
[7] E. Varki, A. Merchant, J. Xu, and X. Qiu, “Issues and Challenges in the Performance Analysis of Real Disk Arrays,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 6, pp. 559-574, June 2004.

Index Terms:
Disk scheduling, SCAN, SPTF, performance analysis.
Alexander Thomasian, Chang Liu, "Comment on "Issues and Challenges in the Performance Analysis of Real Disk Arrays'," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 11, pp. 1103-1104, Nov. 2005, doi:10.1109/TPDS.2005.132
Usage of this product signifies your acceptance of the Terms of Use.