Show simple item record

dc.contributor.authorJohnsson, S. Lennart
dc.contributor.authorHo, Ching-Tien
dc.date.accessioned2016-02-25T16:06:06Z
dc.date.issued1992
dc.identifier.citationJohnsson, S. Lennart and Ching-Tien Ho. 1992. Optimal Communication Channel Utilization for Matrix Transposition and Related Permutations on Binary Cubes. Harvard Computer Science Group Technical Report TR-16-92.en_US
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:25619503
dc.description.abstractWe 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 node 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 internode data exchanges, a property that increases the performance on some architectures. For message passing communication libraries, we present a blocking procedure that minimizes the number of block transfers while preserving the utilization of the communication channels. For schedules with optimal channel utilization, the number of block transfers for binary d-cube is d. The maximum block size for K elements per node is K/2d.en_US
dc.description.sponsorshipEngineering and Applied Sciencesen_US
dc.language.isoen_USen_US
dash.licenseLAA
dc.titleOptimal Communication Channel Utilization for Matrix Transposition and Related Permutations on Binary Cubesen_US
dc.typeResearch Paper or Reporten_US
dc.description.versionVersion of Recorden_US
dc.date.available2016-02-25T16:06:06Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record