Collective in WormholemRouted Massively Parallel Computers

[1]  Jehoshua Bruck,et al.  On the design and implementation of broadcast and global combine operations using the postal model , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[2]  Ming-Yang Kao,et al.  Optimal Broadcast in All-Port Wormhole-Routed Hypercubes , 1994, IEEE Trans. Parallel Distributed Syst..

[3]  Xiaola Lin,et al.  Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  J. Watts,et al.  Interprocessor collective communication library (InterCom) , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[5]  Dhabaleswar K. Panda,et al.  Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme , 1994, PCRCW.

[6]  George Karypis,et al.  Introduction to Parallel Computing , 1994 .

[7]  Amotz Bar-Noy,et al.  Designing broadcasting algorithms in the postal model for message-passing systems , 1992, SPAA '92.

[8]  Bill Nitzberg,et al.  Distributed shared memory: a survey of issues and algorithms , 1991, Computer.