An Efficient Routing Algorithm for Realizing Linear Permutations on p^t-Shuffle-Exchange Networks

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>2 is discussed. Further, by using the techniques developed here, the authors present an optimal O(log n) parallel algorithm for solving a set of linear equations with a nonsingular coefficient matrix when the arithmetic is over the finite field GF(p/sup t/). >

[1]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[2]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[3]  David Steinberg.  Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network , 1983, IEEE Transactions on Computers.

[4]  W. Greub.  Linear Algebra , 1981 .

[5]  Shing-Tsaan Huang,et al.  Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks , 1986, IEEE Transactions on Computers.

[6]  Shing-Tsaan Huang,et al.  Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags , 1988, IEEE Trans. Computers.

[7]  Peter M. Flanders.  A Unified Approach to a Class of Data Movements on an Array Processor , 1982, IEEE Transactions on Computers.

[8]  G. Birkhoff,et al.  A survey of modern algebra , 1942 .

[9]  Douglas Stott Parker,et al.  Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.

[10]  Jacques Lenfant,et al.  Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations , 1978, IEEE Transactions on Computers.

[11]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[12]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[13]  Sartaj Sahni,et al.  An optimal routing algorithm for mesh-connected Parallel computers , 1980, JACM.

[14]  Garrett Birkhoff,et al.  A survey of modern algebra , 1942 .

[15]  Tuvi Etzion,et al.  An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network , 1986, SIAM J. Comput..

[16]  Nathan Linial,et al.  Interpolation Between Bases and the Shuffle Exchange Network , 1989, Eur. J. Comb..

[17]  Richard Cole,et al.  On Edge Coloring Bipartite Graphs , 1980, SIAM J. Comput..

[18]  Tse-Yun Feng,et al.  The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[19]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[20]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[21]  Cauligi S. Raghavendra,et al.  Rearrangeability of multistage shuffle/exchange networks , 1987, ISCA '87.

[22]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.