Dynamic programming in faulty memory hierarchies (cache-obliviously)

DOI10.4230/LIPIcs.FSTTCS.2011.433zbMath1246.68071OpenAlexW2126136185MaRDI QIDQ2911644

Francesco Silvestri, Emanuele G. Fusco, Irene Finocchi, Saverio Caminiti

Publication date: 31 August 2012

Full work available at URL: https://doi.org/10.4230/lipics.fsttcs.2011.433

zbMATH Keywords

dynamic programmingfault-tolerant algorithmscache-oblivious algorithmsGaussian elimination paradigmunreliable memories

Mathematics Subject Classification ID

Dynamic programming (90C39) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting ⋮ Resilient dynamic programming ⋮ Exploiting non-constant safe memory in resilient algorithms and data structures

This page was built for publication: Dynamic programming in faulty memory hierarchies (cache-obliviously)