A Self-Routing Permutation Network

A self–routing permutation network is a connector which can set its own switches to realize any one-to-one mapping of its inputs onto its outputs. Many permutation networks have been reported in the literature, but none with self–routing property, except crossbars and cellular permutation arrays which have excessive cost. This paper describes a self–routing permutation network which has O(log3 n) bit-level delay and uses O(n log3 n) bit-level hardware where n is the number of inputs to the network. The network is derived from a complementary Beneˇs network by replacing each of its two switches in its first stage by what is called a 1–sorter, and recursively defining the switches in the third stage as self– routing networks. The use of 1–sorters results in substantial reduction in both propagation

• Type: Conference
• Year: 1989
• Where: ICPP
• Authors: David M. Koppelman, A. Yavuz Oruç
• Keywords: Cellular Permutation Arrays, Distributed And Parallel Computing, ICPP 1989, Many Permutation Networks, Permutation Network