Research indexPreprint
A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems
Garg
Proceedings of the 23rd International Conference on Distributed Computing and Networking4 Jan 2022Open access
NobleIDark:/48914/w1/20260524/1FF38981DOI10.1145/3491003.3491019
A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems
Garg · Proceedings of the 23rd International Conference on Distributed Computing and Networking · 2022
NobleIDark:/48914/w1/20260524/1FF38981DOI10.1145/3491003.3491019
Abstract
It has been shown that the parallel Lattice Linear Predicate (LLP) algorithm solves many combinatorial optimization problems such as the shortest path problem, the stable marriage problem and the market clearing price problem. In this paper, we give the parallel LLP algorithm for many dynamic programming problems. In particular, we show that the LLP algorithm solves the longest subsequence problem, the optimal binary search tree problem, and the knapsack problem. Furthermore, the algorithm can be used to solve the constrained versions of these problems so long as the constraints are lattice linear. The parallel LLP algorithm works correctly in a distributed system setting where a processor may use an older value of a variable stored at a different processor.