Cary Cherng ; Richard E. Ladner
-
Cache efficient simple dynamic programming
dmtcs:3368 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2005,
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
-
https://doi.org/10.46298/dmtcs.3368
Cache efficient simple dynamic programmingArticle
Authors: Cary Cherng 1; Richard E. Ladner 1
NULL##NULL
Cary Cherng;Richard E. Ladner
1 Department of Computer Science and Engineering [Seattle]
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.
Algorithms for Media-on-Demand Systems; Funder: National Science Foundation; Code: 0098012
Bibliographic References
3 Documents citing this article
Matilda Ferguson;Lila Fontes;Tia Newhall, Practice and Experience in Advanced Research Computing, Efficient Parallelization of Dynamic Programming for Large Applications, pp. 1-9, 2023, Portland OR USA, 10.1145/3569951.3593600, https://doi.org/10.1145/3569951.3593600.
Mohammad Mahdi Javanmard;Pramod Ganapathi;Rathish Das;Zafar Ahmad;Stephen Tschudi;et al., Lecture notes in computer science, Toward Efficient Architecture-Independent Algorithms for Dynamic Programs, pp. 143-164, 2019, 10.1007/978-3-030-20656-7_8.