Communications of the ACM - Special section on computer architecture
Interconnection networks for large-scale parallel processing: theory and case studies
Interconnection networks for large-scale parallel processing: theory and case studies
Flip-Trees: Fault-Tolerant Graphs with Wide Containers
IEEE Transactions on Computers - Fault-Tolerant Computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Hypercube Algorithms and Implementations
Selected Papers from the Second Conference on Parallel Processing for Scientific Computing
Graph Theory With Applications
Graph Theory With Applications
Processor allocation for a class of hypercube-like supercomputers
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Flexible oblivious router architecture
IBM Journal of Research and Development
The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems
IEEE Transactions on Computers
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Multiple-Edge-Fault Tolerance with Respect to Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
IEEE Transactions on Computers
Comments on "Hierarchical Cubic Networks"
IEEE Transactions on Parallel and Distributed Systems
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
IEEE Transactions on Parallel and Distributed Systems
Combinatorial Properties of Two-Level Hypernet Networks
IEEE Transactions on Parallel and Distributed Systems
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Metacube: a new interconnection network for large scale parallel systems
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Folded-crossed hypercube: a complete interconnection network
Journal of Systems Architecture: the EUROMICRO Journal
Automatic Reconfiguration and Yield of the TESH Multicomputer Network
IEEE Transactions on Computers
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems
IEEE Transactions on Parallel and Distributed Systems
Improved Lower Bounds on the Reliability of Hypercube Architectures
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Algorithms for the fixed linear crossing number problem
Discrete Applied Mathematics
The Folded Hypercube ATM Switches
ICN '01 Proceedings of the First International Conference on Networking-Part 2
VLSI/WSI Designs for Folded Cube-Connected Cycles Architectures.
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Sparse hypercube: a minimal k-line broadcast graph
Discrete Applied Mathematics
Fault-tolerance of Complete Josephus Cubes
Journal of Systems Architecture: the EUROMICRO Journal
Efficient Collective Communications in Dual-Cube
The Journal of Supercomputing
The hierarchical cliques interconnection network
Journal of Parallel and Distributed Computing
Forwarding indices of folded n-cubes
Discrete Applied Mathematics
Hierarchical star: a new two level interconnection network
Journal of Systems Architecture: the EUROMICRO Journal
The Josephus Cube: analysis of routing and fault tolerance
Journal of Parallel and Distributed Computing
Hypercube and Its Variant Networks: A Topological Evaluation
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
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
Strong Rabin numbers of folded hypercubes
Theoretical Computer Science
On reliability of the folded hypercubes
Information Sciences: an International Journal
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
Computers & Mathematics with Applications
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
Fault-tolerant cycle embedding in dual-cube with node faults
International Journal of High Performance Computing and Networking
International Journal of High Performance Computing and Networking
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Fault-free cycles in folded hypercubes with more faulty elements
Information Processing Letters
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Some results on topological properties of folded hypercubes
Information Processing Letters
The super spanning connectivity and super spanning laceability of the enhanced hypercubes
The Journal of Supercomputing
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes
Information Processing Letters
Hamiltonian Decomposition of Some Interconnection Networks
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
1-vertex-fault-tolerant cycles embedding on folded hypercubes
Discrete Applied Mathematics
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
Embedding geodesic and balanced cycles into hypercubes
WSEAS Transactions on Mathematics
A further result on fault-free cycles in faulty folded hypercubes
Information Processing Letters
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
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
Fault-tolerant resource placement in balanced hypercubes
Information Sciences: an International Journal
Path embedding on folded hypercubes
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A performance guaranteed new algorithm for fault-tolerant routing in folded cubes
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
Information Sciences: an International Journal
The spanning connectivity of folded hypercubes
Information Sciences: an International Journal
Information Sciences: an International Journal
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
Discrete Applied Mathematics
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Theoretical Computer Science
Topological properties of folded hyper-star networks
The Journal of Supercomputing
Topological properties of the recursive Petersen architecture
Mathematical and Computer Modelling: An International Journal
A case for random shortcut topologies for HPC interconnects
Proceedings of the 39th Annual International Symposium on Computer Architecture
Theoretical Computer Science
Binomial graph: a scalable and fault-tolerant logical network topology
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Fault-tolerant path embedding in folded hypercubes with both node and edge faults
Theoretical Computer Science
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
The Journal of Supercomputing
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences: an International Journal
Cycles embedding on folded hypercubes with faulty nodes
Discrete Applied Mathematics
Research note: An efficient construction of one-to-many node-disjoint paths in folded hypercubes
Journal of Parallel and Distributed Computing
| Hi-index | 0.02 |
A new hypercube-type structure, the folded hypercube (FHC), which is basically astandard hypercube with some extra links established between its nodes, is proposed andanalyzed. The hardware overhead is almost 1/n, n being the dimensionality of thehypercube, which is negligible for large n. For this new design, optimal routing algorithms are developed and proven to be remarkably more efficient than those of the conventional n-cube. For one-to-one communication, each node can reach any other node in the network in at most (n/2) hops (each hop corresponds to the traversal of a single link), as opposed to n hops in the standard hypercube. One-to-all communication (broadcasting) can also be performed in only (n/2) steps, yielding a 50% improvement in broadcasting time over that of the standard hypercube. All routing algorithms are simple and easy to implement. Correctness proofs for the algorithms are given. For the proposedarchitecture, communication parameters such as average distance, message trafficdensity, and communication time delay are derived. In addition, some fault tolerancecapabilities of this architecture are quantified and compared to those of the standardcube. It is shown that this structure offers substantial improvement over existinghypercube-type networks in terms of the above-mentioned network parameters.