The dragon graph: a new interconnection network for high speed computing

Authors:
Jywe-Fei Fang
Affiliations:
St.John's and St.Mary's Institute of Technology, Taipei, Taiwan, R.O.C.
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 8
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
Reconfigurable cube-connected cycles architecture

Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Properties and performance of folded cube-connected cycles

Journal of Systems Architecture: the EUROMICRO Journal
Tighter Layouts of the Cube-Connected Cycles

IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

A new interconnection network called the Dragon graph, is proposed. A Dragon graph is a variation of the hypercube and the cube-connected-cycle with constant degree four. The Dragon graph gains many advantages. It has a smaller diameter and cost than the comparable cube-connected-cycle. It is node-symmetric and edge-symmetric. A routing algorithm and a broadcasting algorithm are proposed in this paper.