Accounting for Memory Use, Cost, Througput, and Latency in the Design of a Media Server

Conventional wisdom holds that reducing disk latency leads to higher disk utilization, maximizing disk utilization leads to higher throughput, employing a faster disk leads to better performance. All of this is true when building a conventional file or database system. In this paper we show that these principles can be misleading when applied to a media server. We examine a number of techniques that have been developed for maximizing disk bandwidth utilization in media servers, including disk arm scheduling and data placement ones. We show that, some disk latency reduction techniques can be counterproductive since memory, rather than disk, is the bottleneck in improving throughput. We present techniques for best memory use under different disk policies, and derive precise formulas for computing memory use. In addition, to precisely account for the design tradeoffs between disk bandwidth and memory use, we propose a cost-based approach that focuses on minimizing the per-stream costs, including the disk and memory ones. Lastly, we study the worst-case initial latency of presentations, a factor that may be important in interactive systems. We present a novel technique for significantly reducing this initial latency under some disk scheduling schemes.

[1]  Banu Özden,et al.  A Low-Cost Storage Server for Movie on Demand Databases , 1994, VLDB.

[2]  Beng Chin Ooi,et al.  Disk striping strategies for large video-on-demand servers , 1997, MULTIMEDIA '96.

[3]  David Kotz,et al.  A Detailed Simulation Model of the HP 97560 Disk Drive , 1994 .

[4]  Philip S. Yu,et al.  Grouped sweeping scheduling for DASD-based multimedia storage management , 1993, Multimedia Systems.

[5]  Edward Y. Chang,et al.  Cost-based media server design , 1998, Proceedings Eighth International Workshop on Research Issues in Data Engineering. Continuous-Media Databases and Applications.

[6]  Edward Y. Chang,et al.  Effective Memory Use in a Media Server , 1997, VLDB.

[7]  Cyrus Shahabi,et al.  On configuring a single disk continuous media server , 1995, SIGMETRICS '95/PERFORMANCE '95.

[8]  Philip S. Yu,et al.  Disk load balancing for video-on-demand systems , 1997, Multimedia Systems.

[9]  Philip S. Yu,et al.  Using rotational mirrored declustering for replica placement in a disk-array-based video server , 1997, Multimedia Systems.

[10]  Stavros Christodoulakis,et al.  Data base design principles for striping and placement of delay-sensitive data on disks , 1998, PODS '98.

[11]  A. L. Narasimha Reddy,et al.  I/O issues in a multimedia system , 1994, Computer.

[12]  Ralf Steinmetz,et al.  Multimedia File Systems Survey: Approaches for Continuous Media Disk Scheduling , 1995, Comput. Commun..

[13]  Edward Y. Chang,et al.  2D BubbleUp: Managing Parallel Disks for Media Servers , 1998, FODO.

[14]  Fouad A. Tobagi,et al.  Streaming RAID: a disk array management system for video files , 1993, MULTIMEDIA '93.

[15]  Hector Garcia-Molina,et al.  Disk striping , 1986, 1986 IEEE Second International Conference on Data Engineering.

[16]  John Wilkes,et al.  An introduction to disk drive modeling , 1994, Computer.

[17]  Edward Y. Chang,et al.  BubbleUp: low latency fast-scan for media servers , 1997, MULTIMEDIA '97.

[18]  Cyrus Shahabi,et al.  On Disk Scheduling and Data Placement for Video Servers , 1995 .

[19]  Raymond T. Ng,et al.  Schemes for Implementing Buffer Sharing in Continuous-Media Systems , 1995, Inf. Syst..