Cache efficient simple dynamic programming - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Cache efficient simple dynamic programming

Résumé

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
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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
98 Consultations
1227 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More