From the theory to the tools: parallel dynamic programming

González, Daniel Lombraña; Almeida, Francisco; Roda, José L.; Rodríguez, Casiano

doi:10.1002/(sici)1096-9128(200001)12:1<21::aid-cpe452>3.0.co;2-2

Cited by 8 publications

(12 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mallba library follows Ibaraki's discrete Dynamic Programming approach for Multistage Problems to represent DP problems [9] and the general parallelization scheme described in [8]. Besides the Problem and Solution classes common to all the skeletons, the DP Skeleton requires from the user the Stage, State and Decision classes.…”

Section: Dynamicmentioning

confidence: 99%

MALLBA: A Library of Skeletons for Combinatorial Optimisation

Alba

Almeida²,

Blesa

et al. 2002

Euro-Par 2002 Parallel Processing

Self Cite

104

View full text Add to dashboard Cite

Abstract. The mallba project tackles the resolution of combinatorial optimization problems using algorithmic skeletons implemented in C ++ . mallba offers three families of generic resolution methods: exact, heuristic and hybrid. Moreover, for each resolution method, mallba provides three different implementations: sequential, parallel for local area networks, and parallel for wide area networks (currently under development). This paper shows the architecture of the mallba library, presents some of its skeletons and offers several computational results to show the viability of the approach.

show abstract

Section: Dynamicmentioning

confidence: 99%

MALLBA: A Library of Skeletons for Combinatorial Optimisation

Alba

Almeida²,

Blesa

et al. 2002

Euro-Par 2002 Parallel Processing

Self Cite

104

View full text Add to dashboard Cite

show abstract

“…Indeed, developing the equations 7 and 8 we obtain respectively. (11) and the global minimum of H1 and V1 is attained at (12) and the global minimum of H2 is attained at (13) and the global minimum of V2 is attained at…”

Section: Appendix a Optimal Tile Sizementioning

confidence: 99%

“…Many authors describe parallel dynamic programming algorithms for specific problems such as 0/1 and integer knapsack problems, resource allocation problems, sequence alignment and least weight subsequences (see [13] for a more detailed overview). This kind of problems has been extensively studied and efficient parallelizations on current architectures have been presented in the last decade.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal tiling for the RNA base pairing problem

Almeida¹,

Andonov

González³

et al. 2002

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures

View full text Add to dashboard Cite

Dynamic programming is an important combinatorial optimization technique that has been widely used in various fields such as control theory, operations research, computational biology and computer science. Many authors have described parallel dynamic programming algorithms for the family of multistage problems. More scarce is the literature for the more general class of problems where dependences appear between non-consecutive stages. Among the important problems falling in this class is the RNA base pairing problem. In this study we propose a new parallel scheme for a large class of recurrences with triangular iteration space and nonuniform dependences that includes the RNA base pairing problem. We derive two different instances of this scheme that correspond to an horizontal and a vertical traverse of the iteration domain. We develop and extend the tiling approach for this particular class. We formulate and analytically solve the optimization problem determining the tile size that minimizes the total execution time of the tiled program on a distributed memory parallel machine. Our analyze is based on the BSP model, which assures the portability of the obtained results. The computational experiments carried out on the CRAY T3E behave according to the predictions of our theoretical model.

show abstract

“…Most works focus on the optimization or the extension of a sequential programming model for a given target computer architecture. For instance, tools are provided for exploiting pipeline parallelism . In this work, the programmers are given a virtually infinite pipeline of algorithm stages that will be automatically mapped to the actual target number of processors.…”

Section: Introductionmentioning

confidence: 99%

Coalition structure generation problems: optimization and parallelization of the IDP algorithm in multicore systems

Cruz

Espinosa

Moure

et al. 2016

Concurrency and Computation

View full text Add to dashboard Cite

Abstract. The Coalition Structure Generation (CSG) problem is wellknown in the area of Multi-Agent Systems. Its goal is to establish coalitions between agents while maximizing the global welfare. Between the existing different algorithms designed to solve the CSG problem, DP and IDP are the ones with smaller temporal complexity. After analyzing the operation of the DP and IDP algorithms, we identify which are the most frequent operations and propose an optimized method. Then, we analyze the memory access pattern and find that its irregular behavior represents a potential performance bottleneck. In addition, we study and implement a method for dividing the work in different threads. We show that selecting the best algorithmic options can improve performance by 10x or more. Furthermore, the execution in a dual-socket, six-core processor computer may increase performance by an additional 5x-6x. With this, we are able to solve a CSG problem of 27 agents using our multi-core computer in 1.2 hours.

show abstract

From the theory to the tools: parallel dynamic programming

Cited by 8 publications

References 16 publications

MALLBA: A Library of Skeletons for Combinatorial Optimisation

MALLBA: A Library of Skeletons for Combinatorial Optimisation

Optimal tiling for the RNA base pairing problem

Coalition structure generation problems: optimization and parallelization of the IDP algorithm in multicore systems

Contact Info

Product

Resources

About