Reduction of Network Cost and Wiring in Ranade's Butterfly Routing

Abstract We investigate implementations of butterfly networks. Obvious mappings of network nodes to chips lead to implementations with expensive wiring. We consider Ranade's butterfly routing algorithm. For this algorithm, we present a new mapping of network nodes to chips. This mapping only needs half the number of chips and links between chips. The chips' interconnections still form a butterfly network.

[1]  Nicholas Pippenger,et al.  Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.

[2]  Wolfgang J. Paul,et al.  On the cost–effectiveness of PRAMs , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[3]  Sandeep N. Bhatt,et al.  The fluent abstract machine , 1988 .

[4]  Wolfgang J. Paul,et al.  On the Physical Design of PRAMs , 1992, Comput. J..

[5]  R. Drefenstedt,et al.  On the physical design of butterfly networks for PRAMs , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[6]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).