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² n) time. The design of an n-input connector with O(n) cost, O(lg² n) depth, and O(lg² 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