
The article presents optimally fast O(log p) time algorithms for computing round-optimal broadcast schedules for message-passing parallel computing systems, where n indivisible blocks of data need to be broadcast from a root processor to all other processors in a fully connected network of p processors.


coremsg

efficient-algorithms-for-computing-round-optimal-broadcast-schedules-in-logarithmic-time


Efficient Algorithms for Computing Round-Optimal Broadcast Schedules in Logarithmic Time
