scispace - formally typeset
Journal ArticleDOI

Routing and path length algorithm for a cost-effective four-tree multistage interconnection network

Prachi Bansal, +2 more
- 01 Jul 1992 - 
- Vol. 73, Iss: 1, pp 107-115
Reads0
Chats0
TLDR
The characteristics of a new class of irregular fault-tolerant multi-stage interconnection network (MIN) called the four-tree (FT) network are analysed and it is found that the network gives a larger throughput than any regular type of MIN due to smaller path lengths between a processor and its favourite memory modules.
Abstract
The characteristics of a new class of irregular fault-tolerant multi-stage interconnection network (MIN) called the four-tree (FT) network are analysed. A FT network can provide ‘full access’ capability even in the presence of multiple faults and is also cost-effective in comparison to other fault tolerant MINs. Rerouting in the presence of faults can be accomplished dynamically without resorting to backtracking. Further, for a non-uniform reference model, the network gives a larger throughput than any regular type of MIN due to smaller path lengths between a processor and its favourite memory modules. Algorithms for computing the path lengths and routing tags are developed for the proposed networks.

read more

Citations
More filters
Journal ArticleDOI

On a fault-tolerant multistage interconnection network

TL;DR: A class of fault-tolerant multistage interconnection networks named as Augmented Baseline Networks (ABNs) is introduced, which achieve a significant improvement over unique-path MINs and compare favorably with other multiple path MINs.
Journal ArticleDOI

Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties

TL;DR: It is claimed that Stable Matching problems are the same as problems about stable configurations of Multi-stage Interconnection Networks (MINs) and solved the Regular and Irregular MINs Stability Problems using the approaches and solutions provided by the St stable Matching Problem.
Proceedings Article

Fault tolerant irregular augmented shuffle network

TL;DR: A new class of Irregular, Fault-tolerant multistage interconnection network named as Irregular Augmented Shuffle Network (IASN) has been proposed which has less number of stages as compared to existing irregular networks and is comparable to FT network.
Proceedings ArticleDOI

A new fault tolerant multistage interconnection network

TL;DR: A class of fault tolerant multistage interconnection network (MIN) named the modified fault tolerant (MFT) network is introduced, which can provide a "full access" capacity in the presence of multiple faults.
Dissertation

On a Class of Multistage Interconnection Networks in Parallel Processing

TL;DR: This paper introduces an irregular class of fault tolerant Multistage Interconnection Network (MINs) named as New Four Tree (NFT) Network, which can provide a “full access” capacity in presence of multiple faults.
References
More filters
Journal ArticleDOI

Performance of Processor-Memory Interconnections for Multiprocessors

TL;DR: The analysis shows that delta networks have a far better performance per cost than crossbars in large multiprocessing systems.
Journal ArticleDOI

The Performance of Multistage Interconnection Networks for Multiprocessors

TL;DR: An asymptotic analysis of the performance of unbuffered banyan networks is presented, thereby solving a problem left open by Patel.
Journal ArticleDOI

The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems

TL;DR: It is shown that the ESC provides fault tolerance for any single failure, and the network can be controlled even when it has a failure, using a simple modification of a routing tag scheme proposed for the Generalized Cube.
Journal ArticleDOI

A Survey and Comparision of Fault-Tolerant Multistage Interconnection Networks

TL;DR: Today all branches of engineering and a multitude of other disciplines rely firmly and increasingly on computational support, but each discipline has important problems that, to be solved feasibly, await the ability to field computers with orders of magnitude greater performance than currently available.
Book

A survey and comparison of fault-tolerant multistage interconnection networks

TL;DR: Intrinsically fault-tolerant multistage interconnection networks (MINs) are surveyed, categorizing the MINs by the amount of hardware modifications they use to provide redundancy.
Related Papers (5)