Sciweavers

264 search results - page 8 / 53
» Bounding the number of tolerable faults in majority-based sy...
Sort
View
FM
2003
Springer
94views Formal Methods» more  FM 2003»
15 years 2 months ago
On Failures and Faults
: Real computer-based systems fail, and hence are often far less dependable than their owners and users need and desire. Individuals, organisations and indeed the world at large ar...
Brian Randell
ESOP
2010
Springer
15 years 6 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
JSA
2000
116views more  JSA 2000»
14 years 9 months ago
A fault tolerant routing algorithm based on cube algebra for hypercube systems
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
Novruz M. Allahverdi, Sirzad S. Kahramanli, Kayhan...
IPPS
2002
IEEE
15 years 2 months ago
A Limited-Global Fault Information Model for Dynamic Routing in 2-D Meshes
In this paper, a fault-tolerant routing in 2-D meshes with dynamic faults is provided. It is based on an early work on minimal routing in 2-D meshes with static faults. Unlike man...
Zhen Jiang, Jie Wu
IPPS
1999
IEEE
15 years 1 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton