Solving Dynamic Programming Problem by Pipeline Implementation on GPU
Published in arXiv (Cornell University) • Aug 5, 2020
Authors:,
Susumu Matsumae
Makoto Miyazaki
Abstract
In this paper, we show the effectiveness of a pipeline implementation of Dynamic Programming (DP) on GPU. As an example, we explain how to solve a matrix-chain multiplication (MCM) problem by DP on GPU. This problem can be sequentially solved in $O(n^3)$ steps by DP where $n$ is the number of matric...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!