Learn More
The OpenMP source code repository (OmpSCR) is an infrastructure that we make available to the OpenMP community. It is based on a set of representative applications and it is supported by a Web site. The aim of this repository is to contribute to the knowledge and widespreading of OpenMP that in the recent times has become the standard tool for program(More)
Following Karp's discrete Dynamic Programming (DP) approach, this work extends the sequential model for monadic DP to the parallel case. We propose general parallel DP algorithms for pipeline and ring networks. The study of the optimality of these algorithms leads us to the introduction of new classes of multistage automata. However, the important class of(More)
The article describes the parallel implementation of skeletons for the divide-and-conquer and branch-and-bound techniques. The user has to choose a paradigm and has to specify for it the type of the problem, the type of solution and the specific characteristics of the technique using the C++ programming language. This information is combined with the(More)
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(More)
The parallelization of the dynamic programming algorithm for the integral knapsack problem is approached from several perspectives. Two of them proceed by dividing the set of objects, while a third one proceeds by partitioning the set of capacities. Furthermore, we propose a new sequential algorithm and its parallelization by reducing the integral knapsack(More)