Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
An architecture for optimal all-to-all personalized communication
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Efficient algorithms for all-to-all communications in multi-port message-passing systems
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
All-to-All Communication on Meshes with Wormhole Routing
Proceedings of the 8th International Symposium on Parallel Processing
An efficient scheme for complete exchange in 2D tori
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Complete Exchange on a Wormhole Routed Mesh
MASCOTS '94 Proceedings of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
On scheduling all-to-all personalized connections and cost-effective designs in WDM rings
IEEE/ACM Transactions on Networking (TON)
Toward Optimal Complete Exchange on Wormhole-Routed Tori
IEEE Transactions on Computers
Configurable Algorithms for Complete Exchange in 2D Meshes
IEEE Transactions on Parallel and Distributed Systems
All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks
IEEE Transactions on Parallel and Distributed Systems
Hybrid Algorithms for Complete Exchange in 2D Meshes
IEEE Transactions on Parallel and Distributed Systems
All-To-All Communication with Minimum Start-Up Costs in 2D/3D Tori and Meshes
IEEE Transactions on Parallel and Distributed Systems
Total-Exchange on Wormhole k-ary n-cubes with Adaptive Routing
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
| Hi-index | 0.00 |
The inter-processor all-to-all communication patterns can be found in many important parallel algorithms. This paper presents new algorithms for all-to-all personalized exchange for circuit switched or wormhole routed 2D and 3D torus connected multiprocessors. The algorithms use message combining to minimize message startups at the expense of larger message sizes. The unique feature of these algorithms is that they are the first algorithms that we know of that operate in a bottom-up fashion rather than a recursive top-down manner.