Fast Parallel Algorithms for Routing One-to-One Assignments in Benes Networks

This paper presents new results on routing unicast (one-to-one) assignments over Benes networks. Parallel routing algorithms with polylogarithmic routing times have been reported earlier [10,8], but these algorithms can only route permutation assignments unless unused inputs are assigned to dummy outputs. This restriction is removed in this paper by using techniques taht permit bypassing idle or unused inputs without any increase in the order of routing cost or routing time.