A Dynamic Sweep Scheme Enabling Scheduling Period Expansions for Continuous Media Playback 


Vol. 12,  No. 5, pp. 355-364, Oct.  2005
10.3745/KIPSTA.2005.12.5.355


PDF
  Abstract

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

  Statistics


  Cite this article

[IEEE Style]

S. C. Lim, "A Dynamic Sweep Scheme Enabling Scheduling Period Expansions for Continuous Media Playback," The KIPS Transactions:PartA, vol. 12, no. 5, pp. 355-364, 2005. DOI: 10.3745/KIPSTA.2005.12.5.355.

[ACM Style]

Sung Chae Lim. 2005. A Dynamic Sweep Scheme Enabling Scheduling Period Expansions for Continuous Media Playback. The KIPS Transactions:PartA, 12, 5, (2005), 355-364. DOI: 10.3745/KIPSTA.2005.12.5.355.