𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fault-tolerance in balanced sorting networks

✍ Scribed by Jianli Sun; Jan Gecsei; Eduard Cerny

Publisher
Springer US
Year
1990
Tongue
English
Weight
662 KB
Volume
1
Category
Article
ISSN
0923-8174

No coin nor oath required. For personal study only.

✦ Synopsis

Much research has been done on sorting networks but there are very few results concerning their robustness. Our starting point is the balanced sorting network introduced by Dowd et al. and its single-block robust design of Rudolph obtained at the cost of some redundancy and two permuters external to the network. In this article we introduce a new implementation which is more robust than Rudolph's network and needs no redundancy or external permuters. We also consider a class of single-stage designs with redundancy and compare the characteristics of networks discussed.

πŸ“œ SIMILAR VOLUMES

Fault-Tolerant Broadcasting in Radio Net
Fault-Tolerant Broadcasting in Radio Networks
✍ 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

Fault-tolerant minimum broadcast network
Fault-tolerant minimum broadcast networks
✍ 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

Sparse networks tolerating random faults
Sparse networks tolerating random faults
✍ T. Yamada; K. Nomura; S. Ueno πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 350 KB

A network G \* is called random-fault-tolerant (RFT) network for a network G if G \* contains a fault-free isomorphic copy of G with high probability even if each processor fails independently with constant probability. This paper proposes a general method to construct an RFT network G \* for any ne

Analysis of Fault Tolerance in Artificia
Analysis of Fault Tolerance in Artificial Neural Networks
✍ Vincenzo Piuri πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 513 KB

Wide attention was recently given to the problem of fault-tolerance in neural networks; while most authors dealt with aspects related to specific VLSI implementations, attention was also given to the intrinsic capacity of survival to faults characterizing the neural modes. The present paper tackles

Fault-tolerant routings in chordal ring
Fault-tolerant routings in chordal ring networks
✍ Lali BarriΓ¨re; Josep FΓ brega; Ester SimΓ³; Marisa ZaragozΓ‘ πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 378 KB πŸ‘ 1 views