A 2*n matrix hypercube graph: a graph with edges of hypercube improved by a half

Authors:
Hyun Sim;Hyeong-Ok Lee;Jae-Cheol Oh
Affiliations:
Department of Computer Science, Sunchon National University, Sunchon, Chonnam, Korea;Department of Computer Education, Sunchon National University, Sunchon, Chonnam, Korea;Department of Computer Science, Sunchon National University, Sunchon, Chonnam, Korea
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
Year:
2009

Citing 7
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Multiple network embeddings into hypercubes

Journal of Parallel and Distributed Computing
Hierarchical Cubic Networks

IEEE Transactions on Parallel and Distributed Systems
A Theory of Fault-Tolerant Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules

IEEE Transactions on Parallel and Distributed Systems
A Survey of Interconnection Networks

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

This study proposes a new interconnection network that has the same number of nodes in a hypercube graph broadly known as phase of a multicomputer but has edges reduced by a half. As a way of reducing the degree of nodes, node address can be assigned in a fonn of matrix and edges can be defined by means of matrix operations. Degree reduces H/W costs and diameter reduces S/W efficiency. Since an actual effect of S/W cost reduction is insufficient, a H/W cost reduction effect can be maximized by reducing edges by a half.