The complexity of reshaping arrays on boolean cubes
S.Lennart Johnsson, Ching-Tien Ho
DMCC 1990
We consider the problem of broadcasting multiple messages from one processor to many processors in the k-port model for message-passing systems. In such systems, processors communicate in rounds, where in every round, each processor can send k messages to k processors and receive k messages from k processors. In this paper, we first present a simple and practical algorithm based on variations of k complete k-ary trees. We then present an optimal algorithm up to an additive term of one for this problem for any number of processors, any number of messages, and any value for k.
S.Lennart Johnsson, Ching-Tien Ho
DMCC 1990
Amotz Bar-Noy, Danny Dolev
Mathematical Systems Theory
S.Lennart Johnsson, Ching-Tien Ho
Discrete Applied Mathematics
Ching-Tien Ho, M.T. Raghunath
DMCC 1991