Multimessage Multicasting with Forwarding
Teofilo F. Gonzalez · 1996
We consider Multimessage Multicasting over the n processor complete (or fully connected) static network (MMC ) with Forwarding. We present an efficient algorithm that constructs for every degree d problem instance a communication schedule with total communication time at most 2d, where d is the maximum number of messages that each processor may send (receive). Our algorithm consists of two phases. In the first phase a set of communications are scheduled to be carried out in d time periods in such a way that the resulting problem is a multimessage unicasting problem of degree d. In the second phase we generate a communication schedule for this problem by reducing it to the Makespan Openshop Preemptive Scheduling problem which can be solved in polynomial time. The final schedule is the concatenation of the communication schedules for these two phases. Our centralized algorithms require all the communication information ahead of time. Applications where all of this information is readily ...