2014 Second International Symposium on Computing and Networking (CANDAR) (2014)
Dec. 10, 2014 to Dec. 12, 2014
In this paper we present a dynamic programming based technique that is suitable for providing exact solutions to a subset of optimisation problems, using general purpose GPU computing. The primary feature of this model is to efficiently use the computational and memory resources of the GPU, whilst still remaining abstract enough to allow implementation on a variety of problems. Secondly, as exact dynamic programming methods are often limited by memory complexity, great consideration has been given to reducing this constraint, allowing large scale problems to be solved. To demonstrate the effectiveness of the proposed model we test it against three problems, the 0-1 knapsack problem, the longest common subsequence problem, and the travelling salesman problem.
Graphics processing units, Optimization, Cities and towns, Instruction sets, Complexity theory, Dynamic programming, Adaptation models
J. F. O'Connell and C. L. Mumford, "An Exact Dynamic Programming Based Method to Solve Optimisation Problems Using GPUs," 2014 Second International Symposium on Computing and Networking (CANDAR), Shizuoka, Japan, 2014, pp. 347-353.