A Skeleton for Parallel Dynamic Programming
The development of skeleton tools constitutes an alternative to cover the gap between current parallel architectures and sequential programmers. Its contruction involves formal models, paradigms and methologies. Based in the automata theory we have developed a formal model for Parallel Dynamic Programming over pipeline networks. This model makes up a paradigm which is the core of skeleton tools oriented to the Dynamic Programming Technique. Following the methodology coerced by the model, we present a tool that provides the user with the ability to obtain parallel programs adapted to the parallel architecture. The efficiency is contrasted on three current parallel platforms: Cray T3E, IBM SP2 and SG Origin 2000.
Unable to display preview. Download preview PDF.
- Almeida F. Models in Parallel Dynamic Programming for the Discrete Case. PHDegree. DEIOC. Unniversidad de La Laguna. October 1996.Google Scholar
- Andonov, Raimbault, Quinton. Dynamic Programming Parallel Implementations for the Knapsack Problem. Technical Report 740. IRISA. June 1993.Google Scholar
- Bellman R. Dynamic Programming. Princeton U. P. 1957.Google Scholar
- Gibbons A., Rytter W., Efficient Parallel Algorithms. Cambridge University Press. 1988.Google Scholar
- Ibaraki T.. Enumerative Approaches to Combinatorial Optimization, Part II. Annals of Operations Research. Volume 11, N. 1-4, 1988.Google Scholar