A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 -l)d,(s + 3)d, K/2 + 24doi:10.1016/0166-218x(94)90189-9 fatcat:vz3qj24elfdzvmzcs2d4kgfzvi