Cache efficient simple dynamic programming

Abstract

New cache-oblivious and cache-aware algorithms for simple dynamic programming based on Valiant's context-free language recognition algorithm are designed, implemented, analyzed, and empirically evaluated with timing studies and cache simulations. The studies show that for large inputs the cache-oblivious and cache-aware dynamic programming algorithms are significantly faster than the standard dynamic programming algorithm.

Keywords

• dynamic programming
• cache-oblivious algorithms
• cache-aware algorithms
• [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
• [math.math-co] mathematics [math]/combinatorics [math.co]
• [info.info-cg] computer science [cs]/computational geometry [cs.cg]
• [info.info-hc] computer science [cs]/human-computer interaction [cs.hc]