Issue No. 09 - September (2005 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.112
<p><b>Abstract</b>—The standard DP (<it>Dynamic Programming</it>) algorithms are limited by the substantial computational demands they put on contemporary serial computers. In this work, the theory behind the solution to serial monadic dynamic programming problems highlights the theory and application of parallel dynamic programming on a general-purpose architecture (<it>Cluster</it> or <it>Network Of Workstations</it>). A simple and well-known technique, message passing, is considered. Several parallel serial monadic DP algorithms are proposed, based on the parallelization in the state variables and the parallelization in the decision variables. Algorithms with no interpolation are also proposed. It is demonstrated how constraints introduce load unbalance which affect scalability and how this problem is inherent to DP.</p>
Parallel dynamic programming, constrained optimization, combinatorial algorithms, networked workstations, performance evaluation, NOWs.
?ngel P. de Madrid, Sebasti? Dormido Canto, Sebasti?n Dormido Bencomo, "Parallel Dynamic Programming on Clusters of Workstations", IEEE Transactions on Parallel & Distributed Systems, vol. 16, no. , pp. 785-798, September 2005, doi:10.1109/TPDS.2005.112