Pipelined all-to-all broadcast in all-port meshes and tori

IEEE Transactions on Computers

Volumn 50, Issue 10, 2001, Pages 1020-1032

  Yang, Yuanyuan ^a,b   Wang, Jianchao ^a,c  

^a IEEE

^b USA   (United States)

^c DataTreasury Corporation   (United States)

Author keywords

All to all broadcast; All to all communication; Broadcast tree; Collective communication; Gossip; Interprocessor communication; Parallel computing; Routing

Indexed keywords

INTERPROCESSOR COMMUNICATION;

ALGORITHMS; BROADCASTING; COMPUTER HARDWARE; INFORMATION THEORY; ROUTERS;

PARALLEL PROCESSING SYSTEMS;

EID: 0035481331     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.956089     Document Type: Article

References (25)

1. Nonblocking broadcast switching networks
2. A class of interconnection networks for multicasting
3. Efficient all-to-all communication patterns in hypercube and mesh topologies
4. All-to-all communication on meshes with wormhole routing
5. All-to-all personalized communication in a wormhole-routed toms
6. Bandwidth-optimal complete exchange on wormhole routed 2D/3D Torus networks: A diagonal-propagation approach
7. Total-exchange on wormhole k-ary n-cubes with adaptive routing
8. All-to-all communication with minimum start-up costs in 2D/3D tori and meshes
9. Efficient all-to-all personalized exchange in multidimensional toms networks
10. Configurable algorithms for complete exchange in 2D meshes
11. Optimum broadcasting and personalized communication in hypercubes
12. Efficient algorithms for all-to-all communications in multi-port message-passing systems
13. Optimal all-to-all personalized exchange in self-routable multistage networks
14. Optimal all-to-all personalized exchange in a class of optical multistage networks
15. Data communication in parallel architectures
16. All-to-all broadcast in toms with wormhole-like routing
17. Fast gossiping on mesh-bus computers
18. Gossiping on meshes and tori
19. Time-independent gossiping on full-port tori
20. Time-optimal gossip of large packets in noncombining 2D tod and meshes
21. Near-optimal all-to-all broadcast in multidimensional all-port meshes and tori
22. On the impact of communication complexity in the design of parallel numerical algorithms
23. Communication efficient basic linear algebra computations on hypercube architectures