Striping and scheduling for large scale multimedia servers

  • Authors:

  • Kyung-Oh Lee;Jun-Ho Park;Yoon-Young Park

  • Affiliations:

  • Department of Computer Science, Sunmoon University, 100, TangJeonMyun, KalsanRi, Asansi ChunNam, 336-850, Korea;Department of Computer Science, Sunmoon University, 100, TangJeonMyun, KalsanRi, Asansi ChunNam, 336-850, Korea;Department of Computer Science, Sunmoon University, 100, TangJeonMyun, KalsanRi, Asansi ChunNam, 336-850, Korea

  • Venue:
  • Journal of Computer Science and Technology
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. Several problems in the designing of large-scale multimedia servers are addressed, with the following contributions: (1) a striping scheme is proposed that minimizes the number of seeks and hence maximizes the performance; (2) a simple and efficient mechanism is presented 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; and (3) the characteristics and resource requirements of several scheduling schemes are investigated 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. It is believed that the results are of value in the design of effective large-scale multimedia servers.