Parallel dynamic programming and automata theory

Parallel Computing

Volumn 26, Issue 1, 2000, Pages 113-134

  Morales, D G ^a   Almeida, F ^a   Rodriguez C ^a   Roda, J L ^a   Coloma, I ^a   Delgado, A ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; DYNAMIC PROGRAMMING; OPTIMIZATION;

MONADIC PROGRAMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0033895633     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(99)00098-8     Document Type: Article

References (36)

1. Aho A., Hopcroft J., Ullman J. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading.
2. V. Aleksandrov, Dynamic Programming Approach of the Knapsack Problems for the Ring of Processors, WPDP93, Sofia, Bulgaria, 1993.
3. F. Almeida, D. Morales, J.L. Roda, C. Rodríguez, F. García, The single resource allocation problem: parallel algorithms on distributed systems, in: Proceedings of the 19 th Technical Conference of the World Occam and Transputer User Group (WOTUG), Nottingham, 1996.
4. Almeida F., García F., Morales D., Rodríguez C. A parallel algorithm for the integer knapsack problem for pipeline networks. Journal of Parallel Algorithms and Applications. 6(3/4):1994.
5. F. Almeida, Models in parallel dynamic programming for the discrete case, Ph.D. DEIOC, University of La Laguna, October 1996.
6. Andonov R., Rajopadhye S. Knapsack on VLSI: from algorithm to optimal circuit. IEE Transcations on Parallel and Distributed Systems. 8(6):1997;545-561.
7. R. Bellman, Dynamic Programming, Princeton, UP, 1957.
8. Chen G., Jang J. An improved parallel algorithm for 0/1 knapsack problems. Parallel Computing. 18:1992;811-821.
9. Deuermeyer B., Curry G. On a language for discrete dynamic programming and a microcomputer implementation. Computers and Operations Research. 16(1):1989;1-11.
10. Doner J. Decidability of the weak second-order theory of two successors. Notices Amer. Math. Soc. 12:1965;365-468.
11. Doner J. Tree Acceptors and some of their applications. Journal of Computer and System Science. 4:1970;406-451.
12. Edmonds P., Chu E., George A. Dynamic programming on a shared memory multiprocessor. Parallel Computing. 19:1993;9-22.
13. Galil Z., Park K. Parallel algorithms for dynamic programming recurrences with more than o(1) dependency. Journal of the Parallel and Distributed Computing. 21:1984;213-222.
14. Gibbons A., Rytter W. Efficient Parallel Algorithms. 1988;Cambridge University Press, Cambridge.
15. A. Hamilton, Estrategias de control Óptimo Basadas en Programactión Dinámica y Redes Neuronales para Sistemas MIMO Coninuos No Lineales. Tesis Doctoral, Departmento de Física Fundamental y Experimental, Universidad de La Laguna, 1995.
16. Hopcroft J., Ullman J. Introduction to Automata Theory Languages and Computation. 1939;Addison-Wesley, Reading.
17. E. Horowitz, S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978.
18. Ibaraki T. Enumerative approaches to combinatorial optimization. Part II. Annals of Operations Research. 11:1988;1-4.
19. Ibaraki T., Katoh N. Resource Allocation Problems. Algorithmic Approaches. 1988;The MIT Press, Cambridge, MA, London.
20. J. JáJá, An Introduction to Parallel Algorithms, Addison Wesley, Reading, 1992.
21. Karp R., Held M. Finite-state processes and dynamic programming. SIAM Journal of Applied Mathematics. 15:1967;693-768.
22. Kindervater G., Trienekens H. Experiments with parallel algorithms for combinatorial problems. European Journal of Operational Research. 33:1998;56-81.
23. J. Lee, E. Shragowitz, S. Sahni, A hypercube algorithm for the 0/1 knapsack problem, Journal of Parallel and Distributed Computing 5, 438-456.
24. G. Li, B.W. Wah, Parallel Processing of Serial Dynamic Programming Programs, in: Proceedings of COMPSAC 85 (1985) 81-89.
25. Louka B., Tchuente M. Dynamic programming on 2d systolic arrays. Parallel Processing. 1988;265-275.
26. Moldovan D., Fortes J. Partitioning and mapping algorithms into fixed size systolic arrays. IEEE Trans. Computer C. 35(1):1986;1-12.
27. D. Morales, J. Roda, F. Almeida, C. Rodríguez, F. García, Integral knapsack problems: parallel algorithms and their implementations on distributed systems, in: Proceedings of the 1995 International Conference on Supercomputing, ACM Press, 1995, pp. 218-226.
28. Moreno L., Ascota L., Sánchez J. Design of algorithms for spatial-time reduction complexity of dynamic programming. IEE Part D Control Theory and Applications. 1992;302-308.
29. Myoupo J. Mapping dynamic programming onto modular linear systolic arrays. Distributed Computing. 6:1993;165-179.
30. Syslo M., Deo N., Kowalik J. Discrete Optimization Algorithms with Pascal Programs. 1983;Prentice-Hall, Englewood Cliffs, NJ.
31. A. Pérez, M. Santos, S. Dormido, F. Morilla, Constrained generalized predictive control with dynamic programming, in: D.W. Clarke (Ed.), Advances in Model-Based Predictive Control with Dynamic Programming, Oxford University Press, Oxford, 1994, pp. 276-290.
32. Teng S. Adaptative parallel algorithms for integral knapsack problems. Journal of Parallel and Distributed Computing. 8:1990;400-406.
33. J. Thatcher, J. Wright, Generalized Finite Automata, Notices Amer. Math. Soc., 820. Abstract No. 1965, pp. 654-649.
34. Thatcher J., Wright J. Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory. 2:1968;57-82.
35. D. Ulm, P. Wang, Solving a two-dimensional knapsack problem on SIMD computers, International Conference on Parallel Processing, 1992.
36. Wah B., Li G., Fen C. Multiprocessing of combinatorial search problems. Computer. 18(6):1985;93-108.