Sciweavers

29 search results - page 2 / 6
» Counting in the Presence of Memory Faults
Sort
View
SC
2004
ACM
14 years 29 days ago
Assessing Fault Sensitivity in MPI Applications
Today, clusters built from commodity PCs dominate high-performance computing, with systems containing thousands of processors now being deployed. As node counts for multi-teraflo...
Charng-da Lu, Daniel A. Reed
OPODIS
2010
13 years 5 months ago
Self-stabilizing Byzantine Asynchronous Unison,
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikh...
MTDT
2003
IEEE
124views Hardware» more  MTDT 2003»
14 years 24 days ago
Systematic Memory Test Generation for DRAM Defects Causing Two Floating Nodes
Abstract: The high complexity of the faulty behavior observed in DRAMs is caused primarily by the presence of internal floating nodes in defective DRAMs. This paper describes a ne...
Zaid Al-Ars, A. J. van de Goor
27
Voted
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 2 months ago
Maximum Metric Spanning Tree made Byzantine Tolerant
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
FTCS
1996
132views more  FTCS 1996»
13 years 8 months ago
An Approach towards Benchmarking of Fault-Tolerant Commercial Systems
This paper presents a benchmark for dependablesystems. The benchmark consists of two metrics, number of catastrophic incidents and performance degradation, which are obtained by a...
Timothy K. Tsai, Ravishankar K. Iyer, Doug Jewitt