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
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 Stanford FLASH multiprocessor
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
The MIT Alewife machine: architecture and performance
ISCA '95 Proceedings of the 22nd 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 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
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
Embedding a family of disjoint 3D meshes into a crossed cube
Information Sciences: an International Journal
A parallel algorithm for interpolation in pancake graph
SEPADS'07 Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Embedding of meshes in Möbius cubes
Theoretical Computer Science
Load-balance and fault-tolerance for embedding a complete binary tree in an IEH with N-expansion
WSEAS Transactions on Computers
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 |
The Flexible Hypercube FHN is an important variant of the Hypercube Hn and possesses many desirable properties for interconnection networks. This paper proposes a novel algorithm of fault-tolerant method for mapping a mesh network in a Flexible Hypercube. The main results obtained (1) a searching path of a FHN is including approximate to (n+1) nodes, where n= [log2 N]. Therefore, there are O(⌊ log2 N ⌋) faults, which can be tolerated. (2) Our results for the mapping methods are optimized mainly for balancing the processor and communication link loads. These results mean that the parallel algorithms developed by the structure of mesh network can be executed in a faulty FHN. 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.