Abstract
This paper introduces the Z-tree, a new interconnection topology for high-performance multicomputer systems which integrates the easy expendability of tree structures with the compactness of the n-dimensional Z-cube. The Z-tree retains the positive features of the tree-hypercube, while at the same time has some additional advantages such as reduced degree, which leads to increased space utilization in a VLSI design. Using analysis and simulation, the topological properties of the Z-tree are examined, and its architectural potential analyzed in terms of message routing and fault tolerance. Communication mechanisms for point to point, broadcasting, and multicasting routing modes are developed. The cost of multicasting is investigated using the i-meter, showing that its routing capabilities are better than that of the hypercube and the mesh. Z-tree's superiority over the hypercube and the tree-hypercube networks is further demonstrated by investigating its cost in terms of the bisection width and the product of the degree and the diameter.
Original language | English |
---|---|
Pages (from-to) | 16-23 |
Number of pages | 8 |
Journal | International Journal of Parallel and Distributed Systems and Networks |
Volume | 3 |
Issue number | 1 |
Publication status | Published - 2000 |