Two methods for the solution of the dynamic programming algorithm on a multiprocessor cluster
- 1 July 1980
- journal article
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 1 (3) , 227-238
- https://doi.org/10.1002/oca.4660010304
Abstract
The dynamic programming algorithm is examined with a view to solving it on a multiprocessor cluster. The two methods of control‐space division and state‐space division are proposed, and their efficiency is analysed in detail. A practical example is given to illustrate the two methods using a two‐processor system, and the results are projected to find the minimum achievable time and optimum number of processors for this example.Keywords
This publication has 3 references indexed in Scilit:
- Dynamic programming and parallel computersJournal of Optimization Theory and Applications, 1973
- Parallel Processing Algorithms for the Optimal Control of Nonlinear Dynamic SystemsIEEE Transactions on Computers, 1973
- A dynamic programming successive approximations technique with convergence proofsAutomatica, 1970