Paul G. Comba
Journal of the ACM
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.
Paul G. Comba
Journal of the ACM
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Susan L. Spraragen
International Conference on Design and Emotion 2010