An Intuitive and Effective New Representation for Interconnection Network Structures

Authors:
Jianer Chen;Lihua Liu;Songqiao Chen;Weijia Jia
Affiliations:
-;-;-;-
Venue:
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Year:
2000

Citing 10
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Group action graphs and parallel architectures

SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Optimal emulations by butterfly-like networks

Journal of the ACM (JACM)
Cycles in the cube-connected cycles graph

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Improved Compressions of Cube-Connected Cycles Networks

IEEE Transactions on Parallel and Distributed Systems
Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes

IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes

IEEE Transactions on Parallel and Distributed Systems
Ring, torus and hypercube architectures/algorithms for parallel computing

Parallel Computing - Special Anniversary issue

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the classical voltage graph theory, we develop a new representation scheme for interconnection network structures. We show that all popular interconnection networks have very simple and intuitive representations under the new scheme. The new representation scheme offers powerful tools for the study of network routing and network emulation. As examples, we present simple constructions for optimal network emulations from cube-connected cycles networks to butterfly networks, and from butterfly networks to hypercube networks.