Efficient massively parallel methods for dynamic programming

DOI10.1145/3055399.3055460zbMATH Open1370.68316OpenAlexW2626928698WikidataQ131122690 ScholiaQ131122690MaRDI QIDQ4978024FDOQ4978024

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

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

zbMATH Keywords

massively parallel computingdynamic programming

Mathematics Subject Classification ID

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

Cited In (9)

• A computational framework based on the dynamic pipeline approach
• Parallel Solution of Sparse One-Dimensional Dynamic Programming Problems
• A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
• \(D\&C\) method for solving large problems in fixed size processor array
• Equivalence classes and conditional hardness in massively parallel computations
• Streaming and query once space complexity of longest increasing subsequence
• Feature-based methods for large scale dynamic programming
• Title not available (Why is that?)
• Scalable Parallel DFPN Search

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)