A Unified Formulation of Honeycomb and Diamond Networks

Authors:
Behrooz Parhami;Ding-Ming Kwai
Affiliations:
Univ. of California, Santa Barbara;Worldwide Semiconductor Corp., Hsinchu, Taiwan
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2001

Citing 9
Cited 25

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
RH: A Versatile Family of Reduced Hypercube Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
The Tera computer system

ICS '90 Proceedings of the 4th international conference on Supercomputing
Honeycomb Networks: Topological Properties and Communication Algorithms

IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Problems with Comparing Interconnection Networks: Is an Alligator Better Than an Armadillo?

IEEE Parallel & Distributed Technology: Systems & Technology
A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes

ICPP '97 Proceedings of the international Conference on Parallel Processing
A New Technique for 3-D Domain Decomposition on Multicomputers which Reduces Message-Passing

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Three-Dimensional Network Topologies

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication

Ring embedding in faulty honeycomb rectangular torus

Information Processing Letters
Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube

EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Generalized honeycomb torus

Information Processing Letters
Higher dimensional hexagonal networks

Journal of Parallel and Distributed Computing
Generalized honeycomb torus is hamiltonian

Information Processing Letters
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
A Group Construction Method with Applications to Deriving Pruned Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes

Discrete Applied Mathematics
The globally Bi-3*-connected property of the honeycomb rectangular torus

Information Sciences: an International Journal
Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks

Journal of Computer and System Sciences
On minimum metric dimension of honeycomb networks

Journal of Discrete Algorithms
Embedding even-length cycles in a hexagonal honeycomb mesh

International Journal of Computer Mathematics
Vertex-bipancyclicity of the generalized honeycomb tori

Computers & Mathematics with Applications
Honeycomb toroidal graphs are Cayley graphs

Information Processing Letters
Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb tori

Computers and Electrical Engineering
Diameter of parallelogramic honeycomb torus

Computers & Mathematics with Applications
Turbo NOC: a framework for the design of network-on-chip-based turbo decoder architectures

IEEE Transactions on Circuits and Systems Part I: Regular Papers
Independent spanning trees on even networks

Information Sciences: an International Journal
Optimal Independent Spanning Trees on Odd Graphs

The Journal of Supercomputing
Further properties of cayley digraphs and their applications to interconnection networks

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
X-torus: a variation of torus topology with lower diameter and larger bisection width

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Comparing four classes of torus-based parallel architectures: Networkparameters and communication performance

Mathematical and Computer Modelling: An International Journal
Hamiltonian properties of honeycomb meshes

Information Sciences: an International Journal
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.