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
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Supercube: An optimally fault tolerant network architecture
Acta Informatica
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
The Stanford Dash Multiprocessor
Computer
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 Conversion Between Binary Code and Binary-Reflected Gray Code on Binary Cubes
IEEE Transactions on Computers
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
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 complete binary tree with 2-expansion ina faulty Flexible Hypercube
Journal of Systems Architecture: the EUROMICRO Journal
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
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
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
Incrementally extensible hypercube networks and their fault tolerance
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |
The Flexible Hypercubes are superior to hypercube in terms of embedding a mesh and torus under faults. Therefore, this paper presented techniques to enhance the novel algorithm for fault-tolerant meshes and tori embedded in Flexible Hypercubes with node failures. The paper demonstrates that O(n2-⌊log2m⌋2) faults can be tolerated and the algorithm is optimized mainly for balancing the processor and communication link loads. Also, the methodology is proven and an algorithm is presented to solve them. These existent parallel algorithms on mesh or torus architectures to be easily transformed to or implemented on the Flexible Hypercube architectures with load 1, congestion 1, dilation 3, and unbounded expansion. The useful properties revealed and the algorithm proposed in this paper can find their way when the system designers evaluate a candidate network's competence and suitability, balancing regularity and other performance criteria, in choosing an interconnection network. Therefore, we can easily port the parallel or distributed algorithms developed for these structuring of mesh and torus to the Flexible Hypercube.