In this invited talk, we contribute carefully engineered implementations of recent resilient algorithms and data structures and report the main results of a ...
Abstract. Large and inexpensive memory devices may suffer from faults, where some bits may arbitrarily flip and corrupt the values of.
We address the problem of implementing data structures resilient to memory faults which may arbitrarily corrupt memory locations.
We address the problem of implementing data structures resilient to memory faults, which may arbitrarily corrupt memory locations.
We address the problem of implementing data structures resilient to memory faults which may arbitrarily corrupt memory locations.
Abstract. We address the problem of implementing data structures re- silient to memory faults which may arbitrarily corrupt memory locations.
We address the problem of implementing data structures resilient to memory faults which may arbitrarily corrupt memory locations.
People also ask
We address the problem of implementing data structures resilient to memory faults which may arbitrarily corrupt memory locations.
In this invited talk I will survey recent work on resilient algorithms and data structures. ... Data Structures Resilient to Memory Faults: An Experimental Study ...
Experimental Study of Resilient Algorithms and Data Structures. Umberto Ferraro Petrillo Irene Finocchi Giuseppe F. Italiano. Published in: SEA (2010).