Issue No. 11 - November (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.324564
<p>This contribution is focused on self-routing permutation networks capable of routing all n! permutations of its n inputs to its n outputs without internal conflict. First, a self-routing permutation network named BNB SRPN is described. The network realizes the self-routing capability on the structure of the generalized baseline network, a modified model of the original baseline network. The network reduced both the hardware and the delay time compared with other comparable networks by a simple algorithm using 1-bit information for the routing decision. The network also has a good hardware regularity. In addition, a cost-effective self-routing network is presented, which is derived from the BNB SRPN. The network's hardware complexity, O(N log N), is the same as that of the Benes network which is not self-routing. The principle realizing a modular structure is also presented. The modular structure is derived from the principle to localize the routing decision. It is shown that the modular structure results in the reduction of the total delay through the network.</p>
network routing; switching networks; multiprocessor interconnection networks; computational complexity; self-adjusting systems; self-routing permutation networks; BNB SRPN; generalized baseline network; delay time; routing decision; hardware complexity; Benes network .
M. Lu and S. Lee, "New Self-Routing Permutation Networks," in IEEE Transactions on Computers, vol. 43, no. , pp. 1319-1323, 1994.