Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems
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.
Bemali Wickramanayake, Zhipeng He, et al.
Knowledge-Based Systems
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Ryan Johnson, Ippokratis Pandis
CIDR 2013