Title :
Efficient networks for realizing point-to-point assignments in parallel processors
Author :
Lu, Ming ; Oruç, A. Yavuz
Author_Institution :
Maryland Univ., College Park, MD, USA
Abstract :
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 (lg2 n) time. The design of an n-input connector with O(n) cost, O(lg2 n) depth, and O(lg2 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
Keywords :
message passing; parallel architectures; concentration schemes; distribution; interprocessor; multiplexing; n-input connector; parallel processors; permutation assignments; point-to-point assignments; processor/memory communications; radix permuter; Concurrent computing; Connectors; Costs; Educational institutions; Intelligent networks; Multiprocessor interconnection networks; Parallel processing; Routing; Sorting; Switches;
Conference_Titel :
Parallel and Distributed Processing, 1992. Proceedings of the Fourth IEEE Symposium on
Conference_Location :
Arlington, TX
Print_ISBN :
0-8186-3200-3
DOI :
10.1109/SPDP.1992.242705