Some of today's 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. 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. In this paper we will survey some recent work on reliable computation in the presence of memory faults. © Springer-Verlag Berlin Heidelberg 2005.
Designing reliable algorithms in unreliable memories / Finocchi, Irene; Grandoni, F.; Italiano, Giuseppe Francesco. - 3669:(2005), pp. 1-8. [10.1007/11561071_1]
Designing reliable algorithms in unreliable memories
Finocchi I.;Italiano G. F.
2005
Abstract
Some of today's 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. 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. In this paper we will survey some recent work on reliable computation in the presence of memory faults. © Springer-Verlag Berlin Heidelberg 2005.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
