Modeling parallel bandwidth: local vs. global restrictions
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
We present a near-optimal algorithm for gossiping in a d-dimensional mesh interconnection network (for arbitrary d/spl ges/2) of busses, under the assumptions that a processor may send/receive simultaneously on all its ports, and message transmission takes unit time regardless of length. For d