Routing linear permutations through the omega network in two passes
J. Keohane, Richard Edwin Stearns · 2003
The problem of routing permutations through an omega network connecting a set of processors is studied in the framework of linear algebra. The class of linear permutations is defined, and it is shown that any linear permutation can be routed through the omega network in two passes. Furthermore, the address of the intermediary processor for the routing can be found in O(n/sup 4/) time, where n is the size of the address of a processor. The class of linear permutations contains the class of bit permute complement permutations, and the address of the intermediary processor for routing bit permute complement permutations can be found in O(n) time.>