Dynamic programming and parallel computers
The computational theory of dynamic programming is examined from the viewpoint of parallel computation. A discussion of various forms of parallelism, the corresponding parallel algorithms, the applicability of the algorithms to different types of optimization problems, and their advantages over serial computation is presented. In addition, parallel aspects of various dimensionality reduction techniques such as state increment dynamic programming, successive approximations, and shift vectors are also given.
KeywordsParallel Algorithm Successive Approximation Shift Vector State Increment Serial Computation
Unable to display preview. Download preview PDF.
- 1.Barnes, G. H.,et al., The ILLIAC IV Computer, IEEE Transactions on Computers, Vol. C-17, No. 8, 1968.Google Scholar
- 3.Wong, P. J.,Dynamic Programming Using Shift Vectors, Stanford University, Center for Systems Research, Report No. 6453-1, 1967.Google Scholar
- 4.Larson, R. E., andKorsak, A. J.,A Dynamic Programming Successive Approximations Technique with Convergence Proofs, Automatica, Vol. 6, 1970.Google Scholar
- 6.Gilmore, P. A.,Structuring of Parallel Algorithms, Journal of the Association for Computing Machinery, Vol. 15, No. 2, 1968.Google Scholar