Title :
Routing linear permutations through the omega network in two passes
Author :
Keohane, John ; Stearns, Richard E.
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Albany, NY, USA
Abstract :
The problem of routing permutations through an omega network connecting a set of processors is studied in the framework of linear algebra. The class of linear permutations is defined, and it is shown that any linear permutation can be routed through the omega network in two passes. Furthermore, the address of the intermediary processor for the routing can be found in O(n4) time, where n is the size of the address of a processor. The class of linear permutations contains the class of bit permute complement permutations, and the address of the intermediary processor for routing bit permute complement permutations can be found in O(n) time
Keywords :
computational complexity; linear algebra; multiprocessor interconnection networks; parallel algorithms; parallel architectures; bit permute complement permutations; intermediary processor; linear algebra; linear permutations; omega network; Computer science; Hardware; Intelligent networks; Joining processes; Laser sintering; Linear algebra; Routing; Switches; Vehicles; Wires;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-5892-4
DOI :
10.1109/FMPC.1988.47407
