Work

Parallel and (Nearly) Work-Efficient Dynamic Programming

Year: 2024

Type: conference-paper

Abstract: The idea of dynamic programming (DP), proposed by Bellman in the 1950s, is one of the most important algorithmic techniques. However, in parallel, many fundamental and sequentially simple problems become more challenging, and open to a (nearly) work-efficient solution (i.e., the work is off by at most a polylogarithmic factor over the best sequential solution). In fact, sequential DP algorithms employ many advanced optimizations such as decision monotonicity or special data structures, and achieve better work than straightforward solutions. Many such optimizations are inherently sequential, which creates extra challenges for a parallel algorithm to achieve the same work bound.

Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

DOI: 10.1145/3626183.3659958

Authors: Xiangyun Ding, Yan Gu, Yihan Sun

Institution: University of California, Riverside

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: National Science Foundation, Universitas Brawijaya