Issue No. 11 - November (1992 vol. 41)

ISSN: 0018-9340

pp: 1479-1483

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.177317

ABSTRACT

<p>A graph with unique path property (UPP) has 2/sup n/ vertices and a unique path of length n between every two vertices. These graphs are very important in the design of architectures and algorithms for interconnection networks. Given two UPP graphs, an algorithm is introduced to determine isomorphism between the graphs. A construction is given for nonisomorphic UPP graphs and a lower bound of 2/sup x/, where x=(2/sup n+1/-3-2)/9, nonisomorphic graphs with 2/sup n/ vertices is shown. UMFA (uniform minimal full access) networks are multistage interconnection networks that use the same interconnection pattern between every two consecutive stages. These networks are derived from UPP graphs, and the most known network of this type is the Omega network. The problem of rearrangeability of UMFA networks is discussed.</p>

INDEX TERMS

UMFA networks; unique path property; interconnection networks; isomorphism; lower bound; uniform minimal full access; Omega network; rearrangeability; multiprocessor interconnection networks; parallel architectures.

CITATION

T. Etzion, D. Goldfeld, "UPP Graphs and UMFA Networks-Architecture for Parallel Systems",

*IEEE Transactions on Computers*, vol. 41, no. , pp. 1479-1483, November 1992, doi:10.1109/12.177317