Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Barnes, G. H.,et al., The ILLIAC IV Computer, IEEE Transactions on Computers, Vol. C-17, No. 8, 1968.
Larson, R. E.,State Increment Dynamic Programming, American Elsevier Publishing Company, New York, New York, 1968.
Wong, P. J.,Dynamic Programming Using Shift Vectors, Stanford University, Center for Systems Research, Report No. 6453-1, 1967.
Larson, R. E., andKorsak, A. J.,A Dynamic Programming Successive Approximations Technique with Convergence Proofs, Automatica, Vol. 6, 1970.
Bellman, R. E.,Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.
Gilmore, P. A.,Structuring of Parallel Algorithms, Journal of the Association for Computing Machinery, Vol. 15, No. 2, 1968.
Bellman, R. E., andDreyfus, S. E.,Applied Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1962.
Additional Bibliography
Karp, R., andMiller, R.,Parallel Program Schemata, Journal of Computer and System Science, Vol. 3, 1969.
Tabak, D.,Computational Improvement of Dynamic Programming by Multi-processing Computers, IEEE Transactions on Automatic Control, Vol. AC-13, No. 5, 1968.
Author information
Authors and Affiliations
Additional information
Communicated by R. E. Kalaba
This research was supported by the Air Force Office of Scientific Research, Contract No. F44620-70-C-0084.
Rights and permissions
About this article
Cite this article
Casti, J., Richardson, M. & Larson, R. Dynamic programming and parallel computers. J Optim Theory Appl 12, 423–438 (1973). https://doi.org/10.1007/BF00940421
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00940421