This Article 
 Bibliographic References 
 Add to: 
An Efficient Real-Time Disk-Scheduling Framework with Adaptive Quality Guarantee
May 2008 (vol. 57 no. 5)
pp. 634-657
A multimedia server requires a real-time disk-scheduling algorithm to deliver isochronous data for real-time streams. Traditional disk-scheduling algorithms focus on providing good quality in a best-effort manner. In this paper, we propose a novel real-time disk-scheduling algorithm called WRRSCAN (Weighted-Round-Robin-SCAN) to provide quality guaranty for all in-service streams encoded at variable bit rates. WRR-SCAN uniquely adopts the concept of imprecise computation to divide a real-time stream into mandatory jobs and optional jobs. The admission control admits a stream as long as its mandatory jobs are guaranteed to meet their deadlines. Such a decision is made in O(1) time as WRR-SCAN reserves a fixed weight for each stream. WRR-SCAN incorporates an aggressive policy to dynamically reclaim reserved-but-unused bandwidth during run-time. The reclaimed bandwidth is used to serve optional jobs for better quality or aperiodic jobs for reduced response time. We conducted a set of experiments to compare WRR-SCAN with a couple of representative and referred disk-scheduling algorithms. The evaluations are conducted on a commonly-used disk simulator with traces from a real multimedia server. The experimental results show that WRR-SCAN completes significantly more disk jobs and yields considerably better quality for real-time streams.

[1] S. Viswanathan and T. Imielinski, “Metropolitan Area Video-on-Demand Service Using Pyramid Broadcasting,” ACM/Springer Multimedia Systems J., vol. 4, no. 4, pp. 197-208, 1996.
[2] C.C. Aggarwal, J.L. Wolf, and P.S. Yu, “A Permutation-Based Pyramid Broadcasting Scheme for Video-on-Demand Systems,” Proc. IEEE Int'l Conf. Multimedia Computing and Systems, pp. 118-126, June 1996.
[3] A.G. Hauptmann and M.J. Witbrock, “Informedia: News-on-Demand Multimedia Information Acquisition and Retrieval,” Intelligent Multimedia Information Retrieval, pp. 215-239, 1997.
[4] M.T. Ozsu, P. IgIinski, D. Szafron, S. El-Medani, and M. Junghanns, “An Object-Oriented SGML/HyTime Compliant Multimedia Database Management System,” Proc. Fifth ACM Int'l Conf. Multimedia, pp. 239-249, 1997.
[5] G. Fischer, “Supporting Learning on Demand with Design Environments,” Proc. Int'l Conf. Learning Sciences, pp. 65-172, Aug. 1991.
[6] K. Lund and V. Goebel, “Adaptive Disk Scheduling in a Multimedia DBMS,” Proc. 11th ACM Int'l Conf. Multimedia, Nov. 2003.
[7] A.L.N. Reddy, J. Wyllie, and K.B.R. Wijayaratne, “Disk Scheduling in a Multimedia I/O System,” ACM Trans. Multimedia Computing, Comm., and Applications, vol. 1, no. 1, pp. 37-59, 2005.
[8] P.J. Shenoy and H.M. Vin, “Cello: A Disk Scheduling Framework for Next Generation Operating System,” ACM SIGMETRICS Performance Evaluation Rev., vol. 26, no. 1, pp. 44-55, 1998.
[9] R. Wijayaratne and A.L.N. Reddy, “Providing QOS Guarantees for Disk I/O,” ACM/Springer Multimedia Systems J., vol. 8, no. 1, pp. 57-68, 2000.
[10] W. Liu, K.-J. Lin, W.-K. Shih, A.C.-S. Yu, J.-Y. Chung, and W. Zhao, “Algorithms for Scheduling Imprecise Computations,” Computer, vol. 24, no. 5, pp. 58-68, May 1991.
[11] K.J. Lin, S. Natarajan, and J.W.-S. Liu, “Imprecise Results: Utilizing Partial Computations in Real-Time Systems,” Proc. Eighth IEEE Real-Time Systems Symp., pp. 210-217, Dec. 1987.
[12] K.J. Lin, S. Natarajan, and J.W.-S. Liu, “Concord: A System of Imprecise Computations,” Proc. 11th Ann. Int'l Computer Software and Applications Conf., Oct. 1987.
[13] G.R. Ganger, B.L. Worthington, and Y.N. Patt, “The DiskSim Simulation Environment Version 3.0 Reference Manual,” Technical Report CMU-CS-03-102, Carnegie Mellon Univ., 2003.
[14] T.-S. Chen, W.-P. Yang, and R.C.T. Lee, “Amortized Analysis of Some Disk Scheduling Algorithms: SSTF SCAN and N-StepSCAN,” BIT, vol. 32, no. 4, pp. 546-558, 1992.
[15] D.P. Anderson, “Metascheduling for Continuous Media,” ACM Trans. Computer Systems, vol. 11, no. 3, pp. 226-252, Aug. 1993.
[16] C.L. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 10, no. 1, pp. 46-61, 1973.
[17] A.L.N. Reddy and J. Wyllie, “Disk Scheduling in a Multimedia I/O System,” Proc. First ACM Int'l Conf. Multimedia, pp. 225-233, 1993.
[18] A.L. Narasimha Reddy and J. Wyllie, “I/O Issues in a Multimedia System,” Computer, vol. 27, no. 3, pp. 69-74, Mar. 1994.
[19] I. Kamel and Y. Ito, “Disk Bandwidth Study for Video Servers,” Technical Report TR-153-96, Matsushita Information Technology Laboratory, 1996.
[20] R.-I. Chang, W.-K. Shih, and R.-C. Chang, “Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling Algorithm,” Proc. 19th IEEE Real-Time Systems Symp., pp. 40-49, 1998.
[21] L. Reuther and M. Pohlack, “Rotational-Position-Aware Real-Time Disk Scheduling Using a Dynamic Active Subset (DAS),” Proc. 24th IEEE Real-Time Systems Symp., Dec. 2003.
[22] C. Ruemmler and J. Wilkes, “An Introduction to Disk Drive Modeling,” Computer, vol. 27, no. 3, pp. 17-28, Mar. 1994.
[23] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” ACM SIGCOMM Computer Comm. Rev., vol. 19, no. 4, pp. 1-12, Sept. 1989.
[24] M. Shreedhar and G. Varghese, “Efficient Fair Queueing Using Deficit Round Robin,” IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375-385, June 1996.
[25] S.S. Kanhere, H. Sethu, and A.B. Parekh, “Fair and Efficient Packet Scheduling Using Elastic Round Robin,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 324-336, Mar. 2002.
[26] G.R. Ganger, “Generating Representative Synthetic Workloads: An Unsolved Problem,” Proc. 21st Int'l Computer Measurement Group Conf., pp. 1263-1269, Dec. 1995.
[27] B.L. Worthington, G.R. Ganger, and Y.N. Patt, “Scheduling Algorithms for Modern Disk Drives,” ACM SIGMETRICS Performance Evaluation Rev., vol. 22, no. 1, pp. 241-251, May 1994.
[28] J. Schindler and G.R. Ganger, “Automated Disk Drive Characterization,” Technical Report CMU-CS-99-176, Carnegie Mellon Univ., 1999.
[29] M. Hefeeda, A. Habib, B. Botev, D. Xu, and B. Bhargava, “PROMISE: Peer-to-Peer Media Streaming Using CollectCast,” Proc. 11th ACM Int'l Conf. Multimedia, Nov. 2003.

Index Terms:
Real-time systems, Performance evaluation, Performance, Scheduling, Imprecise computation, real-time disk-scheduling algorithms, weighted round-robin
Cheng-Han Tsai, Tai-Yi Huang, Edward Chu, Chun-Hang Wei, Yu-Che Tsai, "An Efficient Real-Time Disk-Scheduling Framework with Adaptive Quality Guarantee," IEEE Transactions on Computers, vol. 57, no. 5, pp. 634-657, May 2008, doi:10.1109/TC.2007.70823
Usage of this product signifies your acceptance of the Terms of Use.