The selector-tree network: A new self-routing and non-blocking interconnection network

This paper introduces with the selector-tree network a new self-routing and non-blocking interconnection network: The n × n network is capable of routing any permutation of its n inputs to its n output ports and is therefore non-blocking, and thus, more powerful than Ω-permutation and Banyan networks. In contrast to other non-blocking interconnection networks like the Beneš network, our selector-tree network does not need an additional setup time since the target addresses of the connections directly define the conflict-free routes so that the network is self-routing. The overall depth of the network depends on the implementation of its building block, the selector module: In this paper, we present two preliminary alternatives where the more expensive one requires O(log(n)2) time and O(n2 log(n)) gates while the other one requires O(n) cycles and only O(n) gates for the n × n network. The two alternatives can also be combined to optimize both time and size for particular sizes.