Approximation algorithms for structured communication problems
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
The operations of scattering and gathering in a network of processors involve one proces- sor of the network---call it Po---communicating with all other processors. In scattering, Po sends (possibly) distinct messages to all other processors; in gathering, the other processors send (possibly) distinct messages to Po. We present algorithms for scattering and gathering messages in processor-networks based on interconnection networks of arbitrary topologies. The algorithms are: 7 quite general, in that the messages transmitted can differ arbitrarily in length; 7 quite strong, in that they send messages along noncolliding paths, hence do not require any buffering or queueing mechanisms in the processors; 7 quite efficient: the algorithms for scattering in general networks are optimal, the algo- rithm for gathering in a ring is optimal, and the algorithms for gathering in general networks are nearly optimal.