Communications of the ACM - Special section on computer architecture
Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Processor allocation in an N-cube multiprocessor using gray codes
IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
A recursively scalable network VLSI implementation
Future Generation Computer Systems
The HCN: a versatile interconnection network based on cubes
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Hierarchical Interconnection Networks for Multicomputer Systems
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
The KYKLOS Multicomputer Network: Interconnection Strategies, Properties, and Applications
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
IEEE Transactions on Parallel and Distributed Systems
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Comments on "Hierarchical Cubic Networks"
IEEE Transactions on Parallel and Distributed Systems
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Combinatorial Properties of Two-Level Hypernet Networks
IEEE Transactions on Parallel and Distributed Systems
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Automatic Reconfiguration and Yield of the TESH Multicomputer Network
IEEE Transactions on Computers
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Hierarchical star: a new two level interconnection network
Journal of Systems Architecture: the EUROMICRO Journal
Leader election in hierarchical star network
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
An oblivious shortest-path routing algorithm for fully connected cubic networks
Journal of Parallel and Distributed Computing
On reliability of the folded hypercubes
Information Sciences: an International Journal
Embedding hypercubes, rings, and odd graphs into hyper-stars
International Journal of Computer Mathematics
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A 2*n matrix hypercube graph: a graph with edges of hypercube improved by a half
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A class of hierarchical graphs as topologies for interconnection networks
Theoretical Computer Science
Mstar: a new two level interconnection network
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Hamiltonian cycles in hypercubes with faulty edges
Information Sciences: an International Journal
k-pairwise disjoint paths routing in perfect hierarchical hypercubes
The Journal of Supercomputing
| Hi-index | 0.02 |
In this paper, a new two-level interconnection network, called a hierarchical folded-hypercube network (HFN, for short), is proposed. The HFN takes folded hypercubes as basic modules which are connected in a complete manner. We investigate the topological properties of the HFN, including the diameter, cost, average distance, embedding, connectivity, container, 驴-wide diameter, and node-fault diameter. We show that the HFN can emulate algorithms which are executable on the ring or the mesh-connected computer with the same time complexities in big-O notation. Moreover, the HFN can embed a folded hypercube having the same number of nodes with constant dilation. We compute the diameter, node connectivity, best container, 驴-wide diameter, and node-fault diameter of the HFN. We present optimal routing and broadcasting algorithms for the HFN. The semigroup computation and descend/ascend algorithms can be executed as well on the HFN.