2 search results - page 1 / 1 » Priority Queues Resilient to Memory Faults |
WADS
2007
Springer
13 years 11 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...