Communications of the ACM - Special section on computer architecture
Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Topological Properties of Hypercubes
IEEE Transactions on Computers
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Supercube: An optimally fault tolerant network architecture
Acta Informatica
Topological properties of supercube
Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
The Stanford Dash Multiprocessor
Computer
An effective approach to the enhancement of incomplete hypercube computers
Journal of Parallel and Distributed Computing
The SIMD model of parallel computation
The SIMD model of parallel computation
The Stanford FLASH multiprocessor
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
On the embedding of a class of regular graphs in a faulty hypercube
Journal of Parallel and Distributed Computing
The flexible hypercube: a new fault-tolerant architecture for parallel computing
Journal of Parallel and Distributed Computing
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Load Balancing in Parallel Computers: Theory and Practice
Load Balancing in Parallel Computers: Theory and Practice
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Embedding meshes into crossed cubes
Information Sciences: an International Journal
Communication Structures for Large Networks of Microcomputers
IEEE Transactions on Computers
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Fault Diagnosis in a Boolean n Cube Array of Microprocessors
IEEE Transactions on Computers
On Embedding Hamiltonian Cycles in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Embedding of meshes in Möbius cubes
Theoretical Computer Science
Incrementally extensible hypercube networks and their fault tolerance
Mathematical and Computer Modelling: An International Journal
WSEAS Transactions on Information Science and Applications
Hi-index | 0.00 |
Hypercubes, meshes, and tori are well known interconnection networks for parallel computing. The Supercube network is a generalization of the hypercube. The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper proposes novel algorithms of fault-tolerant meshes and tori embedded in supercubes with node failures. The main results obtained (1) a replacing sequence of a supercube is including approximate to (⌊log2 N⌋ +1) nodes. Therefore, there are O(⌊log2 N⌋) faults, which can be tolerated. (2) The result implies that optimal simulation of mesh and torus in a faulty supercube for balancing the processor and communication link loads at present. According to the result, we can easily port the parallel or distributed algorithms developed for these structures to the supercubes. Therefore, these methods of reconfiguring enable extremely high-speed parallel computation.