Cache efficient simple dynamic programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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.
Fichier principal
Vignette du fichier
dmAD0106.pdf (112.64 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184040 , version 1 (12-08-2015)

Identifiers

Cite

Cary Cherng, Richard E. Ladner. Cache efficient simple dynamic programming. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.49-58, ⟨10.46298/dmtcs.3368⟩. ⟨hal-01184040⟩

Collections

TDS-MACS
96 View
1184 Download

Altmetric

Share

Gmail Facebook X LinkedIn More