Scheduling and data distribution in a multiprocessor video server

We address the problem of distributing and scheduling movies on a multiprocessor video server. We also address the issue of scheduling communication over the multiprocessor switch for the playback of the scheduled movies. A solution is proposed that addresses these three issues at once. The proposed solution minimizes contention for links over the switch. The proposed solution makes movie scheduling very simple-if the first block of the movie is scheduled, the rest of the movie is automatically scheduled. Moreover, if the first block of the movie stream is scheduled without network contention, the proposed solution guarantees that there will be no network contention during the entire duration of playback of that movie.