loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 IEEE International Conference on Multimedia and Expo (ICME'01)
BULK PREFETCHING WITH DEADLINE-DRIVEN SCHEDULING TO MINIMIZE STARTUP LATENCY OF CONTINUOUS MEDIA SERVERS
Tokyo, Japan
August 22-August 25
ISBN: 0-7695-1198-8
Seon Ho Kim, University of Denver
Researches on the continuous media (CM) servers have focused on the throughput issues because the most popular CM application has been the video-on-demand system which provides relatively long video clips or movies. Latency issue has received little attention in such a system because a few seconds up to a few minutes latency is considered tolerable. However, as a variety of multimedia applications are emerging, some applications begin to require interactive presentation of continuous media where the most challenging issue is to minimize startup latency, i.e., minimizing the time between the issuing a request and the start of the display. This paper proposes bulk prefetching techniques to minimize startup latency and analyzes their performance on multi-disk CM servers utilizing a deadline-driven scheduling and random data placement. Simulation results demonstrate a fraction of a second startup latency, which is acceptable for most interactive applications.
Citation:
Seon Ho Kim, "BULK PREFETCHING WITH DEADLINE-DRIVEN SCHEDULING TO MINIMIZE STARTUP LATENCY OF CONTINUOUS MEDIA SERVERS," icme, pp.129, 2001 IEEE International Conference on Multimedia and Expo (ICME'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.