We analyse the fault-tolerant parameters and topological properties of a hierarchical network of hypercubes. We take a close look at the Extended Hypercube (EH) and the Hyperweave (HW) architectures and also compare them with other popular architectures. These two architectures have low diameter and constant degree of connectivity making it possible to expand these networks without affecting the existing configuration. A scheme for incrementally expanding this network is also presented. We also look at the performance of the ASCEND/DESCEND class of algorithms on these architectures
The embedding of one interconnection network into another is a very important issue in the design an...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
evaluating the fault tolerance of an interconnection network, it is essential to estimate the size o...
Hierarchical interconnection networks (HINs) provide a framework for designing networks with reduced...
This thesis, presents a multiprocessor topology, the hierarchical network of hyper-cubes, which has ...
In real-time computing applications, it is important to have parallel computing systems that not onl...
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors ...
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...
The author presents a new design, called fault-tolerant hypercube (FTH), obtained by augmenting the ...
A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-...
This thesis addresses the design of hypercube or hypercube-like message-passing computers that combi...
[[abstract]]The performance of parallel and distributed computer systems depends on the effectivenes...
We examine the issue of running algorithms on a hypercube which has both node and edge faults, and w...
Hypercube networks have received much attention from both parallel processing and communications are...
The embedding of one interconnection network into another is a very important issue in the design an...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
evaluating the fault tolerance of an interconnection network, it is essential to estimate the size o...
Hierarchical interconnection networks (HINs) provide a framework for designing networks with reduced...
This thesis, presents a multiprocessor topology, the hierarchical network of hyper-cubes, which has ...
In real-time computing applications, it is important to have parallel computing systems that not onl...
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors ...
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...
The author presents a new design, called fault-tolerant hypercube (FTH), obtained by augmenting the ...
A new interconnection topology-the extended hypercube-consisting of an interconnection network of k-...
This thesis addresses the design of hypercube or hypercube-like message-passing computers that combi...
[[abstract]]The performance of parallel and distributed computer systems depends on the effectivenes...
We examine the issue of running algorithms on a hypercube which has both node and edge faults, and w...
Hypercube networks have received much attention from both parallel processing and communications are...
The embedding of one interconnection network into another is a very important issue in the design an...
Abstract: In this study, we‘ve analyzed and implemented three different algorithms developed for fau...
evaluating the fault tolerance of an interconnection network, it is essential to estimate the size o...