Designing reliable algorithms in unreliable memories

Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. (2007) Designing reliable algorithms in unreliable memories. Computer Science Review, 1 (2). pp. 77-87. ISSN 1574-0137

Full text not available from this repository.


Some of the present day applications run on computer platforms with large and inexpensive memories, which are also error-prone. Unfortunately, the appearance of even very few memory faults may jeopardize the correctness of the computational results. We say that an algorithm is resilient to memory faults if, despite the corruption of some memory values before or during its execution, it is nevertheless able to get a correct output at least on the set of uncorrupted values (i.e., the algorithm works correctly on uncorrupted data). In this paper we will survey some recent works on resilient algorithms and try to give some insight into the main algorithmic techniques used.

Actions (login required)

View Item View Item