Irregular Personalized Communication on Distributed Memory Machines
Sanjay Ranka, J.C. Wang, Manoj Kumar · Journal of Parallel and Distributed Computing · 1995
In this paper, we present several algorithms for performing all-to-many personalized communication on distributed memory parallel machines. We assume that each processor sends a different message (of potentially different size) to a subset of all the processors involved in the collective communication. The algorithms are based on decomposing the communication matrix into a set of partial permutations. We study the effectiveness of our algorithms from both the view of static scheduling and runtime scheduling.