✦ LIBER ✦

Parallelism and fault-tolerance in the CHORUS

✍ Scribed by J.S. Banino

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 845 KB
Volume: 6
Category: Article
ISSN: 0164-1212
DOI: 10.1016/0164-1212(86)90041-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault-tolerant parallel k selection algo

Fault-tolerant parallel k selection algorithm in n-cube networks

✍ Jang-Ping Sheu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Analysis for performance and reliability

Analysis for performance and reliability of fault-tolerant parallel software

✍ Eiji Sugino; Haruo Yokota 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 2 views

We propose a technique for constructing a fault-tolerant parallel software for general commercial massively parallel computers which are not provided with special fault-tolerant functions. This technique is a hybrid of the primary/backup approach and state machine approach, and can implement paralle

The Flexible Hypercube: A New Fault-Tole

The Flexible Hypercube: A New Fault-Tolerant Architecture for Parallel Computing

✍ Tom Hameenanttila; Xin-Li Guan; Jo Dale Carothers; Jian-Xin Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 265 KB

This paper presents the new Flexible Hypercube architecture. The Flexible Hypercube is a fault-tolerant network topology that can be constructed for an arbitrary number of nodes and is incrementally expandable. This topology maintains the strong features of the Hypercube while overcoming deficiencie

Optimizing fault tolerance to joint jam

Optimizing fault tolerance to joint jam in the design of parallel robot manipulators

✍ Mahir Hassan; Leila Notash 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Node fault tolerance in graphs

✍ Harary, Frank; Hayes, John P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 405 KB 👁 2 views

A graph G \* is a k-node fault-tolerant supergraph of a graph G , denoted k-NFT( G), if every graph obtained by removing k nodes from G\* contains G. A k-NFT(G) graph G\* is said to be optimal if it contains n + k nodes, where n is the number of nodes of G and G \* has the minimum number of edges am

Edge fault tolerance in graphs

✍ Frank Harary; John P. Hayes 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 628 KB