Self-routing least common ancestor networks

Author

Chien, Chi-Kai ; Scherson, Isaac D.

Author_Institution

Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA

fYear

1992

fDate

19-21 Oct 1992

Firstpage

513

Lastpage

514

Abstract

Fat-trees, KYKLOS, baseline and SW-banyan networks, and the TRAC and CM-5 networks belong to a family of networks called least-common-ancestor networks (LCANs). In this paper, attention is restricted to LCANs with identical switches and a uniform stage interconnect. The least common ancestor of two nodes (PEs), A and B, is the node at greatest depth that counts A and B among its descendants: this node corresponds to an LCA switch. Given a source-destination pair, communication progresses upwards to an LCA switch; the stage that it belongs to is called the LCA level. Then, routing returns downwards to the destination. Source-destination pairs are connected using as few stages as their degree of mutual locality permits. Network parameters that facilitate this routing are shown

Keywords

multiprocessor interconnection networks; parallel architectures; CM-5 networks; KYKLOS; SW-banyan networks; TRAC; baseline; fat-trees; mutual locality; self-routing least common ancestor network; source-destination pair; uniform stage interconnect; Bidirectional control; Communication switching; Computer science; Costs; Routing; Switches;

fLanguage

English

Publisher

ieee

Conference_Titel

Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the

Conference_Location

McLean, VA

Print_ISBN

0-8186-2772-7

Type

conf

DOI

10.1109/FMPC.1992.234867

Filename

234867