Optimal Communication Channel Utilization for Matrix Transposition and Related Permutations on Boolean Cubes
1994 (English)In: Journal of Discrete Applied Mathematics, Vol. 53, no 1-3, 251-274 p.Article in journal (Refereed) Published
We present optimal schedules for permutations in which each node sends one or several unique messages to every other node. With concurrent communication on all channels of every node in binary cube networks, the number of element transfers in sequence for K elements per node is K/2, irrespective of the number of nodes over which the data set is distributed. For a succession of s permutations within disjoint subcubes of d dimensions each, our schedules yield min(K/2 + (s - 1)d, (s + 3)d, K/2 + 2d) exchanges in sequence. The algorithms can be organized to avoid indirect addressing in the intermode data exchanges, a property that increases the performance on some architectures.
Place, publisher, year, edition, pages
Elsevier, 1994. Vol. 53, no 1-3, 251-274 p.
PERSONALIZED COMMUNICATION; BOOLEAN CUBES; HYPERCUBES; ARCHITECTURES; ALGORITHMS
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-90989DOI: 10.1016/0166-218X(94)90189-9OAI: oai:DiVA.org:kth-90989DiVA: diva2:507639
NR 201408052012-03-052012-03-05Bibliographically approved