Sciweavers

29 search results - page 1 / 6
» Counting in the Presence of Memory Faults
Sort
View
ISAAC
2009
Springer
130views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Counting in the Presence of Memory Faults
The faulty memory RAM presented by Finocchi and Italiano [1] is a variant of the RAM model where the content of any memory cell can get corrupted at any time, and corrupted cells c...
Gerth Stølting Brodal, Allan Grønlun...
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
14 years 5 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
13 years 8 months ago
The Price of Resiliency: A Case Study on Sorting with Memory Faults
We address the problem of sorting in the presence of faults that may arbitrarily corrupt memory locations, and investigate the impact of memory faults both on the correctness and ...
Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe...
IOLTS
2006
IEEE
102views Hardware» more  IOLTS 2006»
13 years 11 months ago
Emulation-based Fault Injection in Circuits with Embedded Memories
FPGA emulation has proven to be a performance effective method to analyse the behaviour of digital circuits in the presence of soft errors due to SEU effects. In particular, the r...
Mario García-Valderas, Marta Portela-Garc&i...
TEC
2002
103views more  TEC 2002»
13 years 4 months ago
Immunotronics - novel finite-state-machine architectures with built-in self-test using self-nonself differentiation
A novel approach to hardware fault tolerance is demonstrated that takes inspiration from the human immune system as a method of fault detection. The human immune system is a remark...
D. W. Bradley, Andrew M. Tyrrell