𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fault tolerant on-board networks with priorities

✍ Scribed by J.-C. Bermond; F. Havet; C.D. Tóth

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
627 KB
Volume
47
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal fault-tolerant networks with a s
Optimal fault-tolerant networks with a server
✍ 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 on-board computing for ro
Fault-tolerant on-board computing for robotic space missions
✍ Hans P. Zima; Mark L. James; Paul L. Springer 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 425 KB

## SUMMARY This paper describes an approach to providing software fault tolerance for future deep‐space robotic National Aeronautics and Space Administration missions, which will require a high degree of autonomy supported by an enhanced on‐board computational capability. We focus on introspection‐

On the Construction of Fault-Tolerant Cu
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks
✍ J. Bruck; R. Cypher; C.T. Ho 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 772 KB

This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole

Shortest path routing and fault-tolerant
Shortest path routing and fault-tolerant routing on de Bruijn networks
✍ Mao, Jyh-Wen; Yang, Chang-Biau 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB 👁 1 views

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina

An Almost Regular Fault Tolerant Network
An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes
✍ S. Sur; P.K. Srimani 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 514 KB

A new family of almost regular interconnection topology is proposed that can be defined for an arbitrary number of nodes. The proposed network can be very efficiently used to design communication architecture for distributed systems with an arbitrary number of computing nodes. The design involves a