Finding a hamiltonian cycle in a hierarchical dual-net with base network of p -ary q -cube

Authors:
Yamin Li;Shietung Peng;Wanming Chu
Affiliations:
Department of Computer Science, Hosei University, Tokyo, Japan;Department of Computer Science, Hosei University, Tokyo, Japan;Department of Computer Hardware, University of Aizu, Aizu-Wakamatsu, Japan
Venue:
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
Year:
2011

Citing 9
Cited 0

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

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hierarchical Cubic Networks

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

Communications of the ACM
Efficient Collective Communications in Dual-Cube

The Journal of Supercomputing
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks

PDCAT '07 Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies
Looking toward Exascale Computing

PDCAT '08 Proceedings of the 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation

ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Blue Gene/L torus interconnection network

IBM Journal of Research and Development
Hamiltonian Connectedness of Recursive Dual-Net

CIT '09 Proceedings of the 2009 Ninth IEEE International Conference on Computer and Information Technology - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

We first introduce a flexible interconnection network, called the hierarchical dual-net (HDN), with low node degree and short diameter for constructing a large-scale supercomputer. The HDN is constructed based on a symmetric product graph (base network). A k-level hierarchical dual-net, HDN(B,k, S), contains (2N0)2k/(2Πi=1sik) nodes, where S = {si|1 ≤ i ≤ k} is the set of integers with each si representing the number of nodes in a super-node at the level i for 1 ≤ i ≤ k, and N0 is the number of nodes in the base network B. The node degree of HDN(B, k,S) is d0 + k, where d0 is the node degree of the base network. The benefit of the HDN is that we can select suitable si to control the growing speed of the number of nodes for constructing a supercomputer of the desired scale. Then we show that an HDN with the base network of p-ary q-cube is Hamiltonian and give an efficient algorithm for finding a Hamiltonian cycle in such hierarchical dual-nets.