Gang Liu, Michael Sun, et al.
ICLR 2025
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. © 1995 Academic Press, Inc.
Gang Liu, Michael Sun, et al.
ICLR 2025
Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence