๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Fault-Tolerant Multistage Combining Network

โœ Scribed by Neng-Pin Lu; Chung-Ping Chung


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
379 KB
Volume
34
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this paper, we propose a solution to both fault tolerance and hot-spot contention problems in multiprocessor systems with multistage interconnection networks. Combining networks are known to be effective in handling hot-spot traffic. However, the fault tolerance capability of unique-path combining network is insufficient and must be enhanced. Thus, we use the chaining scheme, which provides alternate routing paths by connecting intrastage switching elements with a chain, to enhance the fault tolerance capability of combining network. As a result, we propose a chained combining network. Because of the bidirectionality of combining networks, we also develop routing procedures for the chained combining network. With slight modifications, these routing procedures can also be used in other multipath fault-tolerant combining networks.


๐Ÿ“œ SIMILAR VOLUMES


The W-Network: A low-cost fault-tolerant
โœ Theobald, Kevin B. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 930 KB

Large-scale multiprocessors require an efficient interconnection network to achieve good performance. This network, like the rest of the system, should befuulf-tolcrunt (able to continue operating even when there are hardware failures). This paper presents the W-Network, a lowcost fault-tolerant MIN

Fault-tolerant minimum broadcast network
โœ Ahlswede, R.; Gargano, L.; Haroutunian, H. S.; Khachatrian, L. H. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 978 KB

Broadcasting is the task of transmitting a message originated at one processor of a communication network to all other processors in the network. A minimal k-fault-tolerant broadcast network is a communication network on n vertices in which any processor can broadcast in spite of up to k line failur

Optimal fault-tolerant networks with a s
โœ Choudum, S. A.; Sivagurunathan, S. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 1 views

Fast computation through parallel processing and large distributed memory are two important qualities of new multiprocessor computing machines. Various processors of these machines are interconnected through a suitable network. However, a fault in a single processor may drastically reduce the perfor

Fault-Tolerant Broadcasting in Radio Net
โœ Evangelos Kranakis; Danny Krizanc; Andrzej Pelc ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 151 KB

We consider broadcasting in radio networks that are subject to permanent node failures of unknown location. Nodes are spread in a region in some regular way. We consider two cases: nodes are either situated at integer points of a line or they are situated in the plane, at grid points of a square or

Networked control systems tolerant to fa
โœ Alessandro Casavola; Chandrasekhar Kambhampati ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 42 KB ๐Ÿ‘ 2 views