The Chained-Cubic Tree Interconnection Network

The core of a parallel processing system is the interconnection network by which the system’s processors are linked. Due to ‎the great role played by the interconnection network’s topology in improving the parallel processing system’s performance, ‎various topologies have been proposed in the literature. This paper proposes a new interconnection network topology, ‎referred to as the chained-cubic tree, in which chains of hypercubes are arranged in a tree structure. The major topological ‎properties of the proposed topology have been investigated, including its diameter, degree, connectivity, bisection width, size, ‎cost, and hamiltonicity. A comparative study is then conducted between the proposed Chained-Cubic Tree (CCT) and other ‎interconnection networks’ topologies, including tree and hypercube in order to evaluate the rank occupied by CCT among ‎other well-known topologies in terms of various performance and cost metrics. The concluding results proved that the CCT ‎topology overcomes the shortcomings of its progenitors, tree and hypercube, while keeping most of its appealing properties.‎