Title :
A 2*n matrix hypercube graph: A graph with edges of hypercube improved by a half
Author :
Sim, Hyun ; Lee, Hyeong-Ok ; Oh, Jae-Cheol
Author_Institution :
Dept. of Comput. Sci., Sunchon Nat. Univ., Sunchon
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 form 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.
Keywords :
graph theory; hypercube networks; matrix algebra; network theory (graphs); interconnection network; matrix hypercube graph edge; multicomputer; Algorithm design and analysis; Computer networks; Concurrent computing; Costs; Hypercubes; Message passing; Multiprocessor interconnection networks; Parallel processing; Predictive models; Weather forecasting; 2byN; Hypercube; edges; matrix;
Conference_Titel :
Advanced Communication Technology, 2009. ICACT 2009. 11th International Conference on
Conference_Location :
Phoenix Park
Print_ISBN :
978-89-5519-138-7
Electronic_ISBN :
1738-9445