From the theory to the tools: Parallel dynamic programming

Concurrency Practice and Experience

Volumn 12, Issue 1, 2000, Pages 21-34

  Gonzalez D ^a   Almeida, F ^a   Roda, J ^a   Rodriguez C ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012650394     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(200001)12:1<21::AID-CPE452>3.0.CO;2-2     Document Type: Article

References (24)

1. Ibaraki T. Enumerative approaches to combinatorial optimization, Part II. Ann. Oper. Res. 1988; 11(1-4).
2. Karp R, Held M. Finite-state processes and dynamic programming. SIAM J. Appl. Math. 1967; 15:693-768.
3. Aleksandrov V. Dynamic programming approach of the knapsack problems for the ring of processors. WPDP93, Sofia, Bulgaria, 1993.
4. Almeida F, García F, Morales D, Rodríguez C. A parallel algorithm for the integer knapsack problem for pipeline networks. J. Parallel Algorithms Appl. 1994; 6(3/4):87-91.
5. Andonov R, Raimbault M, Quinton P. Dynamic programming parallel implementations for the knapsack problem. Technical Report 740, IRISA, June 1993.
6. Chen G, Jang J. An improved parallel algorithm for 0/1 knapsack problems. Parallel Comput. 1992; 18:811-821.
7. Kindervater G, Trienekens H. Experiments with parallel algorithms for combinatorial problems. Eur. J. Oper. Res. 1988; 33:65-81.
8. Lee J, Shragowitz E, Sahni S. A hypercube algorithm for the 0/1 knapsack problem. J. Parallel Distrib. Comput. 1988; 5:438-456.
9. Morales D, Roda J, Almeida F, Rodríguez C, García F. Integral knapsack problems: parallel algorithms and their implementations on distributed systems. Proceedings of the 1995 International Conference on Supercomputing. ACM Press, 1995; 218-226.
10. Teng S. Adaptative parallel algorithms for integral knapsack problems. J. Parallel Distrib. Comput. 1990; 8:400-406.
11. Ulm D, Wang P. Solving a two-dimensional knapsack problem on SIMD computers. International Conference on Parallel Processing, 1992.
12. Louka B, Tchuente M. Dynamic programming on 2D systolic arrays. Parallel Process. 1988; 265-275.
13. Myoupo J. Mapping dynamic programming onto modular linear systolic arrays. Distrib. Comput. 1993; 6:165-179.
14. Edmonds P, Chu E, George A. Dynamic programming on a shared memory multiprocessor. Parallel Comput. 1993; 19:9-22.
15. Galil Z, Park K. Parallel algorithms for dynamic programming recurrences with more than O(1) dependency. J. Parallel Distrib. Comput. 1984; 21:213-222.
16. Gibbons A, Rytter W. Efficient Parallel Algorithms. Cambridge University Press, 1988.
17. Wah B, Li G, Fen C. Multiprocessing of combinatorial search problems. Computer 1985; 18(6):93-108.
18. Bellman R. Dynamic programming. Princeton U.P., 1957.
19. Hopcroft J, Ullman J. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, 1939.
20. Almeida F, Morales D, Roda JL, Rodríguez C, García F. The single resource allocation problem: parallel algorithms on distributed systems. Proceedings of the 19th Technical Conference of the World Occam and Transputer User Group (WOTUG), Nottingham, 1996.
21. Ibaraki T, Katoh N. Resource Allocation Problems. Algorithmic Approaches. The MIT Press: Cambridge, MA, London, 1988.
22. Morin T, Marsten R. Branch-and-bound strategies for dynamic programming. Oper. Res. 1976; 24(4):611-627.
23. Syslo M, Deo N, Kowalik J. Discrete Optimization Algorithms with Pascal Programs. Prentice-Hall: Englewood Cliffs, NJ, 1983.
24. Moldovan D, Fortes J. Partitioning and mapping algorithms into fixed size systolic arrays. IEEE Trans. Comput. 1986C-35(1):1-12.