Optimal scheduling for normal and interactive operations in parallel video servers

This paper presents scheduling algorithms for normal and interactive playout in parallel video servers. These algorithms include conflict-free scheduling, delay minimization, and request relocation for normal playout, as well as prefetching and grouping for interactive operations. Performance is presented for these algorithms.

[1]  A. L. Narasimha Reddy.  Scheduling and data distribution in a multiprocessor video server , 1995, Proceedings of the International Conference on Multimedia Computing and Systems.

[2]  Min-You Wu,et al.  Scheduling for large-scale parallel video servers , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).

[3]  Min-You Wu,et al.  Scheduling for interactive operations in parallel video servers , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[4]  Guru M. Parulkar,et al.  Design of a Large Scale Multimedia Storage Server , 1994, Comput. Networks ISDN Syst..

[5]  Guru Parulkar,et al.  Design of a Large Scale Multimedia Server , 1994 .

[6]  Jonathan C. L. Liu,et al.  Performance of a Mass-Storage System for Video-on-Demand , 1995, J. Parallel Distributed Comput..