Dynamic programming can be used to solve many problems that involve making optimal decisions over time, such as planning, scheduling, resource allocation, and optimization.

Dynamic programming is - calculated once, and used multiple times. Imagine how inefficient it would be if I asked you to calculate the same thing again and again if it has already been calculated ...

Most hash table implementations do not support concurrent operations. Therefore, one of our project deliverables will be a concurrent hash table. With a concurrent hash table, dynamic programming can ...

We study how to best make use of the a GPU to implement lock-free concurrent hash tables, and on top of that highly parallel dynamic programming. We show that the right hash table can be remarkably ...

In this paper, we show the effectiveness of a pipeline implementation of Dynamic Programming (DP) on GPU. As an example, we parallelize a typical DP program where each element of its solution table is ...