Virtual IO: preemptible disk access

ABSTRACT

Supporting preemptible disk access is essential for interactive multimedia applications that require short response time. In this study, we propose Virtual IO, an abstraction for disk IO, that transforms a non-preemptible IO request into a preemptible one. In order to achieve its objective efficiently, Virtual IO uses disk profiling to obtain accurate and detailed knowledge about the disk. Upon implementation of Virtual IO, we show that not only does Virtual IO enable highly preemptible disk access, but it does so with little or no loss in disk throughput.

REFERENCES

• 1: Ronald Azuma, Tracking requirements for augmented reality, Communications of the ACM, v.36 n.7, p.50-51, July 1993 [doi>10.1145/159544.159581]
• 2: Edward Chang , Hector Garcia-Molina, BubbleUp: low latency fast-scan for media servers, Proceedings of the fifth ACM international conference on Multimedia, p.87-98, November 09-13, 1997, Seattle, Washington, United States [doi>10.1145/266180.266339]
• 3: S. J. Daigle and J. K. Strosnider. Disk scheduling for multimedia data streams. Proceedings of the IS&T/SPIE, February 1994.
• 4: Z. Dimitrijevic, R. Rangaswami, and E. Chang. Design, analysis, and implementation of Virtual IO. http://www.cs.ucsb.edu/~zoran/papers/vio02.pdf, September 2002.
• 5: Z. Dimitrijevic, R. Rangaswami, E. Chang, D. Watson, and A. Acharya. Diskbench. http://www.cs.ucsb.edu/~zoran/papers/db01.pdf, November 2001.
• 6: C. R. Lumb, J. Schindler, G. R. Ganger, and D. F. Nagle. Towards higher disk head utilization: Extracting free bandwith from busy disk drives. Proceedings of the OSDI, 2000.
• 7: A. Molano , K. Juvva , R. Rajkumar, Real-time filesystems. Guaranteeing timing constraints for disk accesses in RT-Mach, Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS '97), p.155, December 03-05, 1997
• 8: C. Shahabi , S. Ghandeharizadeh , S. Chaudhuri, On Scheduling Atomic and Composite Continuous Media Objects, IEEE Transactions on Knowledge and Data Engineering, v.14 n.2, p.447-455, March 2002 [doi>10.1109/69.991729 ]
• 9: Prashant J. Shenoy , Harrick M. Vin, Cello: a disk scheduling framework for next generation operating systems, Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, p.44-55, June 22-26, 1998, Madison, Wisconsin, United States
• 10: Wallapak Tavanapong , Kien A. Hua , James Z. Wang, A framework for supporting previewing and VCR operations in a low bandwidth environment, Proceedings of the fifth ACM international conference on Multimedia, p.303-312, November 09-13, 1997, Seattle, Washington, United States [doi>10.1145/266180.266381]
• 11: Bruce L. Worthington , Gregory R. Ganger , Yale N. Patt, Scheduling algorithms for modern disk drives, Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.241-251, May 16-20, 1994, Nashville, Tennessee, United States
• 12: X. Yu, B. Gum, Y. Chen, R. Y. Wang, K. Li, A. Krishnamurthy, and T. E. Anderson. Trading capacity for performance in a disk array. Proceedings of the OSDI, October 2000.