Exploiting non-constant safe memory in resilient algorithms and data structures

We extend the Faulty RAM model by Finocchi and Italiano (2008) by adding a safe memory of arbitrary size S, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory. Let δ and α denote, respectively, the maximum amount of faults which c...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 583; pp. 86 - 97
Main Authors:	De Stefani, Lorenzo, Silvestri, Francesco
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 07.06.2015
Subjects:	Algorithms Fault tolerance Faults Inserts Memory errors Priorities Priority queue Queues Random access memory Resilient algorithm Resilient data structure Sorting Sorting algorithms State of the art Tradeoffs Memory errors Fault tolerance Tradeoffs Resilient algorithm Resilient data structure Priority queue Sorting
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!