Two methods for the solution of the dynamic programming algorithm on a multiprocessor cluster
暂无分享,去创建一个
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.
[1] Edison Tse,et al. Parallel Processing Algorithms for the Optimal Control of Nonlinear Dynamic Systems , 1973, IEEE Transactions on Computers.
[2] R. Larson,et al. Dynamic programming and parallel computers , 1973 .