Computer Interconnection Structures: Taxonomy, Characteristics, and Examples
ACM Computing Surveys (CSUR)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
A general class of processor interconnection strategies
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Memory-processor connection networks
Memory-processor connection networks
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Communication Structures for Large Networks of Microcomputers
IEEE Transactions on Computers
Analysis of Chordal Ring Network
IEEE Transactions on Computers
Graph Theoretical Analysis and Design of Multistage Interconnection Networks
IEEE Transactions on Computers
A Fault-Tolerant Communication Architecture for Distributed Systems
IEEE Transactions on Computers
The Lens Interconnection Strategy
IEEE Transactions on Computers
Design and Performance of Generalized Interconnection Networks
IEEE Transactions on Computers
A Survey of Interconnection Networks
Computer
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
On an Optimally Fault-Tolerant Multiprocessor Network Architecture
IEEE Transactions on Computers
Processor allocation in an N-cube multiprocessor using gray codes
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
Bidirectional versus Unidirectional Networks: Cost/Performance Trade-Offs
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
The Shuffle-Ring: Overcoming the Increasing Degree of Hypercube
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Finding Hamiltonian Cycles on Incrementally Extensible Hypercube Graphs
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Proceedings of the 2003 conference on APL: stretching the mind
Fault hamiltonicity of augmented cubes
Parallel Computing
A new family of interconnection networks of odd fixed degrees
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
PeerCluster: A Cluster-Based Peer-to-Peer System
IEEE Transactions on Parallel and Distributed Systems
Containment properties of product and power graphs
Discrete Applied Mathematics
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
Computers & Mathematics with Applications
A Distributed Cache Coherence Protocol for Hypercube Multiprocessors
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
On Fault-Tolerant Distributor Communication Architecture
IEEE Transactions on Computers
RTOIN: a new scalable optical interconnection network
Proceedings of the 2nd international conference on Scalable information systems
Edge-bipancyclicity of a hypercube with faulty vertices and edges
Discrete Applied Mathematics
A unified fault-tolerant routing scheme for a class of cluster networks
Journal of Systems Architecture: the EUROMICRO Journal
Note: The Independence Number for De Bruijn networks and Kautz networks
Discrete Applied Mathematics
Hamiltonian Decomposition of Some Interconnection Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
1-vertex-fault-tolerant cycles embedding on folded hypercubes
Discrete Applied Mathematics
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
The Journal of Supercomputing
Fault-Free Cycles in Conditional Faulty Folded Hypercubes
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
One-to-many node-disjoint paths in (n,k)-star graphs
Discrete Applied Mathematics
MDCube: a high performance network structure for modular data center interconnection
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A further result on fault-free cycles in faulty folded hypercubes
Information Processing Letters
A fault-tolerant communication scheme for regular cluster networks
CIIT '07 The Sixth IASTED International Conference on Communications, Internet, and Information Technology
Fault-tolerant resource placement in balanced hypercubes
Information Sciences: an International Journal
Topological properties of twisted cube
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Fault-tolerant mapping of a mesh network in a flexible hypercube
WSEAS Transactions on Computers
Path embedding on folded hypercubes
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
Improving the scalability of data center networks with traffic-aware virtual machine placement
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fault-tolerant meshes and tori embedded in a faulty supercube
WSEAS Transactions on Computers
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
The Journal of Supercomputing
Construction of vertex-disjoint paths in alternating group networks
The Journal of Supercomputing
A lightweight media access protocol for a WDM-based distributed shared memory system
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Scalable and cost-effective interconnection of data-center servers using dual server ports
IEEE/ACM Transactions on Networking (TON)
WSEAS Transactions on Information Science and Applications
Panconnectivity of Cartesian product graphs
The Journal of Supercomputing
On fault-tolerant embedding of meshes and tori in a flexible hypercube with unbounded expansion
WSEAS TRANSACTIONS on SYSTEMS
Note: Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
Theoretical Computer Science
2-Dilated flattened butterfly: A nonblocking switching topology for high-radix networks
Computer Communications
ALIAS: scalable, decentralized label assignment for data centers
Proceedings of the 2nd ACM Symposium on Cloud Computing
Self-organizing systems based on morphogenesis principles
IBM Journal of Research and Development
Fault-Free pairwise independent hamiltonian paths on faulty hypercubes
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Matrix-Star graphs: a new interconnection network based on matrix operations
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Jellyfish: networking data centers, randomly
HotCloud'11 Proceedings of the 3rd USENIX conference on Hot topics in cloud computing
On two-layer brain-inspired hierarchical topologies – a rent's rule approach –
Transactions on High-Performance Embedded Architectures and Compilers IV
Mstar: a new two level interconnection network
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Jellyfish: networking data centers randomly
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Graph theoretic characterization and reliability of the multiple-clique network
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Incrementally extensible hypercube networks and their fault tolerance
Mathematical and Computer Modelling: An International Journal
Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks
Computer Communications
RAMCube: exploiting network proximity for ram-based key-value store
HotCloud'12 Proceedings of the 4th USENIX conference on Hot Topics in Cloud Ccomputing
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
Two spanning disjoint paths with required length in generalized hypercubes
Theoretical Computer Science
Conditional edge-fault pancyclicity of augmented cubes
Theoretical Computer Science
On the topological properties of HyperX
The Journal of Supercomputing
| Hi-index | 15.00 |
A general class of hypercube structures is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. The interconnection is based on a mixed radix number system and the technique results in a variety of hypercube structures for a given number of processors N, depending on the desired diameter of the network. A cost optimal realization is obtained through a process of discrete optimization. The performance of such a structure is compared to that of other existing hypercube structures such as Boolean n-cube and nearest neighbor mesh computers.