DPSKEL: a skeleton based tool for parallel dynamic programming

Authors:
Ignacio Peláez;Francisco Almeida;Fernando Suárez
Affiliations:
Departamento de Estadística, I. O. y Computación, Universidad de La Laguna, La Laguna, Spain;Departamento de Estadística, I. O. y Computación, Universidad de La Laguna, La Laguna, Spain;Departamento de Estadística, I. O. y Computación, Universidad de La Laguna, La Laguna, Spain
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 12
Cited 2

Efficient parallel algorithms

Efficient parallel algorithms
On efficient parallel computations for some dynamic programming problems

Theoretical Computer Science
Dynamic programming on two-dimensional systolic arrays

Information Processing Letters
A common schema for dynamic programming and branch and bound algorithms

Journal of the ACM (JACM)
Enumerative approaches to combinatorial optimization - part III

Annals of Operations Research
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Parallel algorithms for dynamic programming recurrences with more than O(1) dependency

Journal of Parallel and Distributed Computing
Optimal orthogonal tiling of 2-D iterations

Journal of Parallel and Distributed Computing
Parallel dynamic programming and automata theory

Parallel Computing - High performance computing in operations research
Optimal semi-oblique tiling

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Multiprocessing of Combinatorial Search Problems

Computer

From latex specifications to parallel codes

The Journal of Supercomputing
Skeletal based programming for dynamic programming on MultiGPU systems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Skeleton based libraries are considered one of the alternatives to reduce the distance between end users and parallel architectures. Algorithmic skeletons are based in general procedures describing the method to be implemented. Although a gap between general formalizations for dynamic programming and software components can be found, we develop a skeleton tool for dynamic programming problems. The design strategy is general enough to consider a wide rage of dynamic programming recurrences. As usual in skeleton approaches, the parallelism is provided in a transparent manner, so that, sequential users may access to the system. A set of tests problems representative of different classes of dynamic programming formulations has been used to validate the distributed memory implementation on an IBM-SP.