Sorting and Searching in Faulty Memories

Authors:
Irene Finocchi;Giuseppe F. Italiano
Affiliations:
Dipartimento di Informatica, Università degli Studi di Roma “La Sapienza”, Via Salaria 113, 00198, Rome, Italy;Università degli Studi di Roma “Tor Vergata”, Dipartimento di Informatica, Sistemi e Produzione, Via del Politecnico 1, 00133, Rome, Italy
Venue:
Algorithmica
Year:
2008

Citing 0
Cited 6

Resilient dictionaries

ACM Transactions on Algorithms (TALG)
Recursive merge sort with erroneous comparisons

Discrete Applied Mathematics
Lossless fault-tolerant data structures with additive overhead

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Experimental study of resilient algorithms and data structures

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Data structures resilient to memory faults: an experimental study of dictionaries

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Resilient algorithms and data structures

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the design and analysis of algorithms resilient to memory faults. We focus on algorithms that, despite the corruption of some memory values during their execution, are nevertheless able to produce a correct output at least on the set of uncorrupted values. In this framework, we consider two fundamental problems: sorting and searching. In particular, we prove that any O(nlog n) comparison-based sorting algorithm can tolerate the corruption of at most O((nlog n)1/2) keys. Furthermore, we present one comparison-based sorting algorithm with optimal space and running time that is resilient to O((nlog n)1/3) memory faults. We also prove polylogarithmic lower and upper bounds on resilient searching.