Sciweavers

87 search results - page 4 / 18
» Exploiting Instruction Redundancy for Transient Fault Tolera...
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...
TCAD
2010
105views more  TCAD 2010»
13 years 2 months ago
Fault Tolerant Network on Chip Switching With Graceful Performance Degradation
The structural redundancy inherent to on-chip interconnection networks [networks on chip (NoC)] can be exploited by adaptive routing algorithms in order to provide connectivity eve...
Adán Kohler, Gert Schley, Martin Radetzki
ICCD
2005
IEEE
159views Hardware» more  ICCD 2005»
14 years 1 months ago
Architectural-Level Fault Tolerant Computation in Nanoelectronic Processors
Nanoelectronic devices are expected to have extremely high and variable fault rates; thus future processor architectures based on these unreliable devices need to be built with fa...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
PRDC
2006
IEEE
14 years 1 months ago
Fault-Tolerant Rate-Monotonic Scheduling Algorithm in Uniprocessor Embedded Systems
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
Hakem Beitollahi, Geert Deconinck
DATE
2010
IEEE
111views Hardware» more  DATE 2010»
14 years 17 days ago
Instruction precomputation with memoization for fault detection
—Fault tolerance (FT) has become a major concern in computing systems. Instruction duplication has been proposed to verify application execution at run time. Two techniques, inst...
Demid Borodin, Ben H. H. Juurlink