| Summary: | 碩士 === 國立花蓮教育大學 === 學習科技研究所 === 97 === The performance of parallel architectures is affected by it's network topology. Therefore,choice of the topological structure of parallel processing is an important factor.
Hypercubes and Crossed Cubes are two well know architectures in interconnection networks of their advantages. We study an architecture combining the characteristics
of Hypercube and Crossed cube called Hierarchical Crossed Cube. The Hierarchical Crossed cube is a newly introduced interconnection network for parallel computing, denoted by HCC(k,n) and this network combines by the hierarchical structure of hypercube and crossed cube. In this thesis, we investigate the problem of embedding cycles into a Hierarchical Crossed cube. Our main contribution is to construct that, for each integer l ∈ {4, 5, . . . , 2^{2n+k}}, a cycle of length l can be embedded into a n ≥ 3 Hierarchical Crossed cube and passes through any given
node in HCC(k,n).
|
|---|
