Lock-free parallel dynamic programming
From MaRDI portal
Publication:666192
Recommendations
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
- scientific article; zbMATH DE number 3978860
- Dynamic programming on a shared-memory multiprocessor
- On efficient parallel computations for some dynamic programming problems
- From the theory to the tools: parallel dynamic programming
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- A Theorem on Boolean Matrices
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Dynamic programming to minimize the maximum number of open stacks
- Establishing the optimality of sequencing heuristics for cutting stock problems
- Heuristics for sequencing cutting patterns
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
- Split-ordered lists
Cited in
(7)- Efficient massively parallel methods for dynamic programming
- Nondeterministic dynamic programming on a parallel coprocessing system
- Parallel computing applied to the stochastic dynamic programming for long term operation planning of hydrothermal power systems
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
- Dynamic programming to minimize the maximum number of open stacks
- Table space designs for implicit and explicit concurrent tabled evaluation
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
This page was built for publication: Lock-free parallel dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666192)
