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.
CITATION STYLE
Cherng, C., & Ladner, R. E. (2005). Cache efficient simple dynamic programming. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AD,...(Proceedings). https://doi.org/10.46298/dmtcs.3368
Mendeley helps you to discover research relevant for your work.