Efficient networks for realizing point-to-point assignments in parallel processors

Point-to-point assignments constitute a significant part of interprocessor and processor/memory communications in parallel computers. Using a combination of multiplexing, distribution, and concentration schemes, the authors present the first O(n) cost network that can realize all n-element point-to-point assignments, including permutation assignments, in O(lg/sup 2/ n) time. The design of an n-input connector with O(n) cost, O(lg/sup 2/ n) depth, and O(lg/sup 2/ n) routing time is described. The key concept behind this connector is a multiplexing scheme that permits the cost of the radix permuter described by C.Y. Jan and A.J. Oruc to be reduced to O(n) without increasing its routing time.<<ETX>>

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

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

[3]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[4]  Gene Eu Jan,et al.  Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network , 1993, IEEE Trans. Computers.

[5]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

[6]  A. Yavuz Oruç,et al.  A Self-Routing Permutation Network , 1990, J. Parallel Distributed Comput..