Pramod Ganapathi

Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency

State-of-the-art cache-oblivious parallel algorithms for dynamic programming (DP) problems usually guarantee asymptotically optimal cache performance without any tuning of cache parameters, but they often fail to exploit the theoretically best parallelism at the same time. While these algorithms achieve cache-optimality through the use of a recursive divide-and-conquer (DAC) strategy, scheduling tasks at the granularity of task dependency introduces artificial dependencies in addition to those arising from the defining recurrence equations. We removed the artificial dependency by scheduling tasks ready for execution as soon as all its real dependency constraints are satisfied, while preserving the cache-optimality by inheriting the DAC strategy. We applied our approach to a set of widely known dynamic programming problems, such as Floyd-Warshalls All-Pairs Shortest Paths, Stencil, and LCS. Theoretical analyses show that our techniques improve the span of 2-way DAC-based Floyd Warshalls algorithm on an

AUTOGEN: automatic discovery of cache-oblivious parallel recursive algorithms for solving dynamic programs

n

High-Performance Energy-Efficient Recursive Dynamic Programming with Matrix-Multiplication-Like Flexible Kernels

node graph from

An Efficient Cache-oblivious Parallel Viterbi Algorithm

Thn^2n

Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms

to

The Range 1 Query (R1Q) Problem

Thn

Autogen: Automatic Discovery of Efficient Recursive Divide-8-Conquer Algorithms for Solving Dynamic Programming Problems

, stencil computations on a

The I/O Complexity of Computing Prime Tables

d

The range 1 query (R1Q) problem

-dimensional hypercubic grid of width

High-performance recursive dynamic programming for bioinformatics using MM-like flexible kernels

w