Abstract:- 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 = 2log N ⎢ ⎥ ⎣ ⎦. Therefore, there are O ( ) 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...
Abstract- This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. T...
[[abstract]]Faults in a network may take various forms such as hardware failures while a node or a l...
A new interconnection network with low-degree for very large parallel computers called metacube (MC)...
[[abstract]]The performance of parallel and distributed computer systems depends on the effectivenes...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
Embedding in an interconnection network maps the interconnection network G to H and analyzes the rel...
In real-time computing applications, it is important to have parallel computing systems that not onl...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors ...
The author presents a new design, called fault-tolerant hypercube (FTH), obtained by augmenting the ...
This thesis addresses the design of hypercube or hypercube-like message-passing computers that combi...
This paper presents an optimal broadcast algorithm for the hypercube networks. The main focus of the...
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any n...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
Abstract- This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. T...
[[abstract]]Faults in a network may take various forms such as hardware failures while a node or a l...
A new interconnection network with low-degree for very large parallel computers called metacube (MC)...
[[abstract]]The performance of parallel and distributed computer systems depends on the effectivenes...
The hypercube-like networks are a class of important generalization of the popular hypercube interco...
Embedding in an interconnection network maps the interconnection network G to H and analyzes the rel...
In real-time computing applications, it is important to have parallel computing systems that not onl...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorith...
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors ...
The author presents a new design, called fault-tolerant hypercube (FTH), obtained by augmenting the ...
This thesis addresses the design of hypercube or hypercube-like message-passing computers that combi...
This paper presents an optimal broadcast algorithm for the hypercube networks. The main focus of the...
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any n...
Faults in a network may take various forms such as hardware/software errors, vertex/edge faults, etc...
Abstract- This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. T...
[[abstract]]Faults in a network may take various forms such as hardware failures while a node or a l...
A new interconnection network with low-degree for very large parallel computers called metacube (MC)...