Loosely synchronous communication, Node contention, Non-uniform message size, Personalized communications, Runtime scheduling, Static scheduling
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 both from the view of static scheduling and from runtime scheduling.
Ranka, Sanjay and Wang, Jhy-Chun, "Irregular Personalized Communication on Distributed Memory Machines" (1995). L.C. Smith College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects. Paper 38.