Irregular Personalized Communication on Distributed Memory Machines |
| |
Affiliation: | Univ Illinois, Dept Comp Sci, Urbana, IL 61801, USA; IBM Corp, TJ Watson Res Ctr, Hawthorne, NY, USA and Syracuse Univ, Sch Comp & Informat Sci, Ctr Sci & Technol 4116, Syracuse, NY 13244, USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|