Issue No. 01 - January (2001 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.899940
<p><b>Abstract</b>—Honeycomb and diamond networks have been proposed as alternatives to mesh and torus architectures for parallel processing. When wraparound links are included in honeycomb and diamond networks, the resulting structures can be viewed as having been derived via a systematic pruning scheme applied to the links of 2D and 3D tori, respectively. The removal of links, which is performed along a diagonal pruning direction, preserves the network's node-symmetry and diameter, while reducing its implementation complexity and VLSI layout area. In this paper, we prove that honeycomb and diamond networks are special subgraphs of complete 2D and 3D tori, respectively, and show this viewpoint to hold important implications for their physical layouts and routing schemes. Because pruning reduces the node degree without increasing the network diameter, the pruned networks have an advantage when the degree-diameter product is used as a figure of merit. Additionally, if the reduced node degree is used as an opportunity to increase the link bandwidths to equalize the costs of pruned and unpruned networks, a gain in communication performance may result.</p>
Cayley graph, k-ary n-cube, network topology, processor array, pruned torus network, VLSI layout.
Ding-Ming Kwai, Behrooz Parhami, "A Unified Formulation of Honeycomb and Diamond Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 12, no. , pp. 74-80, January 2001, doi:10.1109/71.899940