Decremental Scattering for Data Transport Between Host and Hypercube Nodes

There are many parallel signal processing algorithms that are I/O bound. For such algorithms, fast data and program diStribution is very important. In this paper we study a new strategy for data: distribuUonfiom host to MIMD hypercube nodes. This strategy, based on scatteeng on hypercubes of decremental dimensions, perform much better than other strategies known today. It optimizes both the host and node utilization and also exploits the possible overlap in data sent i o different nodes.