When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. We address several problems in t...
When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. We address several problems in the designing of large-scale multimedia servers, with the following contributions: (I) We first propose a striping scheme that minimizes the number of seeks and hence maximizes the performance. (2) We present a simple and efficient mechanism to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system: (3) We investigate the characteristics and resource requirements of several scheduling schemes in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. We believe that our results are of value in the design of effective large-scale multimedia servers.