The Chained-Cubic Tree Interconnection Network

The Chained-Cubic Tree Interconnection Network ‎

Malak Abdullah1, Emad Abuelrub2, and Basel Mahafzah3‎
‎1Department of Computer Science, Jordan University of Science and Technology, Jordan
‎2Department of Computer Science, Zarqa Private University, Jordan
‎3Department of Computer Science, The University of Jordan, Jordan ‎



Abstract: 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.‎

Keywords: Chained-cubic tree, hypercube, tree, interconnection network topology.‎

 

Received October 15, 2009; accepted November 5, 2009‎

  

Full Text

Read 3698 times Last modified on Thursday, 23 June 2011 05:04
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…