A message passing strategy for array redistributions in a torus network
The array redistribution problem occurs in many important applications in parallel computing. In this paper, we consider this
problem in a torus network. Tori are preferred to other multidimensional networks (like hypercubes) due to their better scalability
(IEE Trans. Parallel Distrib. Syst. 50(10), 1201–1218, ). We present a message combining approach that splits any array redistribution problem in a series of broadcasts where all
sources send messages of the same size, thus a balanced traffic load is achieved. Unlike existing array redistribution algorithms,
the scheme introduced in this work eliminates the need for data reorganization in the memory of the source and target processors.
Moreover, the processing of the scheduled broadcasts is pipelined, thus the total cost of redistribution is reduced.