Title :
Least common ancestor networks
Author :
Scherson, Isaac D. ; Chien, Chi-Kai
Author_Institution :
Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA
Abstract :
Least common ancestor networks (LCANs) are introduced and shown to be a class of networks that include fat-trees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0, and the CM-5. Some LCAN properties are stated and the permutation routing capabilities of an important subclass are analyzed. Simulation results for three permutation classes verify the accuracy of an iterative solution for a randomized routing strategy
Keywords :
multiprocessor interconnection networks; CM-5; LCANs; SW-banyans; TRAC 1.1; baseline networks; fat-trees; iterative solution; least common ancestor networks; multistage interconnection networks; permutation routing capabilities; randomized routing strategy; router networks; Bidirectional control; Computer science; Genetic mutations; Integrated circuit interconnections; Labeling; Multiprocessor interconnection networks; Network topology; Routing; Switches; Switching circuits;
Conference_Titel :
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Conference_Location :
Newport, CA
Print_ISBN :
0-8186-3442-1
DOI :
10.1109/IPPS.1993.262825
