Efficient massively parallel methods for dynamic programming

DOI10.1145/3055399.3055460MaRDI QIDQ4978024zbMATH OpenOpenAlexWikidataFDO

Authors Sungjin Im, Benjamin Moseley, Xiaorui Sun

Publication date 17 August 2017

Published in Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3055399.3055460

zbMATH Keywords

dynamic programmingmassively parallel computing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Dynamic programming (90C39)

Recommendations

• Brief announcement: MapReduce algorithms for massive trees
• Algorithmic aspects of parallel data processing
• Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
• From the theory to the tools: parallel dynamic programming
• Lock-free parallel dynamic programming

Cited in

(11)

• Feature-based methods for large scale dynamic programming
• Equivalence classes and conditional hardness in massively parallel computations
• D\&C method for solving large problems in fixed size processor array
• Scalable Parallel DFPN Search
• Parallel Solution of Sparse One-Dimensional Dynamic Programming Problems
• Algorithmic aspects of parallel data processing
• Brief announcement: MapReduce algorithms for massive trees
• Log diameter rounds algorithms for 2-vertex and 2-edge connectivity
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• A computational framework based on the dynamic pipeline approach
• Streaming and query once space complexity of longest increasing subsequence

This page was built for publication: Efficient massively parallel methods for dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978024)