Premium
Two methods for the solution of the dynamic programming algorithm on a multiprocessor cluster
Author(s) -
AlDabass D.
Publication year - 1980
Publication title -
optimal control applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.458
H-Index - 44
eISSN - 1099-1514
pISSN - 0143-2087
DOI - 10.1002/oca.4660010304
Subject(s) - multiprocessing , computer science , division (mathematics) , dynamic programming , cluster (spacecraft) , parallel computing , state space , state (computer science) , scheme (mathematics) , algorithm , mathematics , programming language , arithmetic , mathematical analysis , statistics
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.