Local dependency dynamic programming in the presence of memory faults

DOI10.4230/LIPICS.STACS.2011.45MaRDI QIDQ3113671zbMATH OpenFDO

Authors Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_66e7.html

zbMATH Keywords

edit distancefault-tolerant algorithmslocal dependency dynamic programmingunreliable memories

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Analysis of algorithms (68W40) Dynamic programming (90C39)

Recommendations

• Resilient dynamic programming
• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Designing reliable algorithms in unreliable memories
• Algorithms – ESA 2005
• Resilient algorithms and data structures

Cited in

(3)

• The local memory access sequence of multiple induction variables on distributed memory machines
• Dynamic programming in faulty memory hierarchies (cache-obliviously)
• Resilient dynamic programming

This page was built for publication: Local dependency dynamic programming in the presence of memory faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113671)