A class of hierarchical graphs as topologies for interconnection networks

摘要: We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the crossed cube HCC(k,n), which draws upon constructions used within well-known hypercube also cube. In particular, we study: construction shortest paths between arbitrary vertices in HCC(k,n); connectivity one-to-all broadcasts parallel machines whose underlying topology is HCC(k,n) (with both one-port multi-port store-and-forward models communication). Moreover, our proofs are applicable not just to cubes but networks formed by replacing with other families networks. As such, provide generic accompanying results relating wide range