Abstract- The subcube allocation problem in faulty hypercubes is studied in this paper. An efficient method for forming the set of regular subcubes is proposed. A concept of irregular subcubes is then introduced to take advantage of the advanced switching techniques such as wormhole routing to increase the size of available sub¬ cubes. In this paper, a two-phase fault tolerant subcube allocation strategy is proposed. The first phase is the re¬ configuration process based on a modified subcube parti¬ tioning technique which finds the set of disjoint subcubes in the faulty hypercube. The second phase is to apply an existing fault-free subcube allocation strategy such as Buddy strategy to each disjoint subcube for assigning the fault-free avai...
We consider the problem of determining the minimum number of faulty processors, K(n, m), and of faul...
Massively parallel computers, using thousands of processors, will be the future trend for producing ...
Hypercube multiprocessors can efficiently execute a wide class of parallel algorithms. To obtain a r...
In this papel; by utilizing the circuit-switched communi-cation modules of the hypercube nodes, we p...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
This paper examines the problem of locating large faultfree subcubes in multiuser hypercube systems....
The author presents a new design, called fault-tolerant hypercube (FTH), obtained by augmenting the ...
We examine the issue of running algorithms on a hypercube which has both node and edge faults, and w...
The Hypercube is one of the most appealing topologies among the interconnection networks designed fo...
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors ...
[[abstract]]Most of previous researches use node address as the notation for hypercube systems. Howe...
In this paper, we present load redistribution algorithms for hypercubes in the presence of faults. O...
In this paper, we present a real-time fault-tolerant design for a d-dimensional hypercube multiproce...
[[abstract]]Hypercube multiprocessor systems are attracted by many researchers in parallel processin...
AbstractWe consider the problem of determining the minimum number of faulty processors, K(n, m), and...
We consider the problem of determining the minimum number of faulty processors, K(n, m), and of faul...
Massively parallel computers, using thousands of processors, will be the future trend for producing ...
Hypercube multiprocessors can efficiently execute a wide class of parallel algorithms. To obtain a r...
In this papel; by utilizing the circuit-switched communi-cation modules of the hypercube nodes, we p...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
This paper examines the problem of locating large faultfree subcubes in multiuser hypercube systems....
The author presents a new design, called fault-tolerant hypercube (FTH), obtained by augmenting the ...
We examine the issue of running algorithms on a hypercube which has both node and edge faults, and w...
The Hypercube is one of the most appealing topologies among the interconnection networks designed fo...
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors ...
[[abstract]]Most of previous researches use node address as the notation for hypercube systems. Howe...
In this paper, we present load redistribution algorithms for hypercubes in the presence of faults. O...
In this paper, we present a real-time fault-tolerant design for a d-dimensional hypercube multiproce...
[[abstract]]Hypercube multiprocessor systems are attracted by many researchers in parallel processin...
AbstractWe consider the problem of determining the minimum number of faulty processors, K(n, m), and...
We consider the problem of determining the minimum number of faulty processors, K(n, m), and of faul...
Massively parallel computers, using thousands of processors, will be the future trend for producing ...
Hypercube multiprocessors can efficiently execute a wide class of parallel algorithms. To obtain a r...