Optimization theory with applications
Optimization theory with applications
Optimal, predictive, and adaptive control
Optimal, predictive, and adaptive control
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing
Asynchronous Analysis of Parallel Dynamic Programming Algorithms
IEEE Transactions on Parallel and Distributed Systems
In search of clusters (2nd ed.)
In search of clusters (2nd ed.)
Parallel programming: techniques and applications using networked workstations and parallel computers
High Performance Cluster Computing: Programming and Applications
High Performance Cluster Computing: Programming and Applications
High Performance Cluster Computing: Architectures and Systems
High Performance Cluster Computing: Architectures and Systems
Dynamic Programming
MPI: The Complete Reference
Principles of Dynamic Programming: Advanced Theory and Applications
Principles of Dynamic Programming: Advanced Theory and Applications
Introduction to Dynamic Programming
Introduction to Dynamic Programming
Principles of Dynamic Programming: Basic Analytical and Computational Methods
Principles of Dynamic Programming: Basic Analytical and Computational Methods
IEEE Transactions on Parallel and Distributed Systems
On the Parallel Execution Time of Tiled Loops
IEEE Transactions on Parallel and Distributed Systems
Parallel Implementation of the Unit Commitment problem on NOWs
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Dynamic Programming
Performance of message-passing MATLAB toolboxes
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
SCE toolboxes for the development of high-level parallel applications
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
A coarse-grained parallel algorithm for the matrix chain order problem
Proceedings of the 2012 Symposium on High Performance Computing
Parallel longest common subsequence using graphics hardware
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
| Hi-index | 0.00 |
The standard DP (Dynamic Programming) 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 (Cluster or Network Of Workstations). 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.