A Unified Approach to a Class of Data Movements on an Array Processor
IEEE Transactions on Computers
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
An efficient algorithm for generating linear transformations in a shuffle exchange network
SIAM Journal on Computing
Rearrangeability of multistage shuffle/exchange networks
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags
IEEE Transactions on Computers
Hierarchical Classification of Permutation Classes in Multistage Interconnection Networks
IEEE Transactions on Computers
| Hi-index | 14.98 |
The authors present an efficient routing algorithm for realizing any permutation in LIN (linear-permutation-class) on single-stage shuffle-exchange networks with k*k switching elements, where k=p is a prime number. For any positive integer number n there are N=k/sup n/ processors connected by the network. The proposed algorithm can realize LIN in 2n-1 passes; it can be implemented by using Nn processors in O(n) time. It can also be extended to the shuffle-exchange networks with (p/sup t/*p/sup t/) switching elements, where t is a positive integer number. In addition, the routing of any arbitrary permutations on the networks with any integer k