We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable multistage networks. We consider routing arbitrary ...

We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable interconnects. It is well-known that this type of ...

In this paper, we consider routing arbitrary permutations with link-disjoint paths and node-disjoint paths in such interconnects in a minimum number of passes.

In this paper, we consider efficiently routing permutations in a class of switch-based interconnects. Permutation is an important communication pattern in ...

We present a generic approach to realizing arbitrary permutations in a class of unique-path, self-routable multistage networks. We consider routing arbitrary ...

In this paper, we consider routing arbitrary permutations with link-disjoint paths and node-disjoint paths in such interconnects in a minimum number of passes.

By Corollary 1, any permutation can be realized in a baseline network with link-disjoint paths in two passes. By directly using the self-routing method, we can ...

It is shown that an arbitrary permutation can be realized in a baseline network (or a reverse baseline network) with node-disjoint paths in four passes, ...

In this paper, we consider routing arbitrary permutations on an optical baseline network (or reverse baseline network) with node-disjoint paths. We first prove ...

10 Excerpts. Routing permutations with link-disjoint and node-disjoint paths in a class of self-routable networks · Yuanyuan YangJianchao Wang. Computer Science.