Filters








2,246 Hits in 5.0 sec

A sublinear parallel algorithm for some dynamic programming problems

Shou-Hsuan Stephen Huang, Hongfei Liu, Venkatraman Viswanathan
1992 Theoretical Computer Science  
Viswanathan, A sublinear parallel algorithm for some dynamic programming problems, Theoretical Computer Science 106 (1992) 361-371.  ...  This paper presents a sublinear parallel algorithm for dynamic programming problems such as computing an optimal order of matrix multiplications, an optimal binary search tree or an optimal triangulation  ...  Acknowledgment The authors thank the referees and the editor for the comments and the corrections they made to an earlier draft of the paper.  ... 
doi:10.1016/0304-3975(92)90258-h fatcat:cv74x5ys2jgkneqzzx2loygqpm

POSTER

Yuan Tang, Ronghui You
2017 SIGPLAN notices  
By exploiting properly on the runtime system, we show that our STAR (Space-Time Adaptive and Reductive) technique can help these dynamic programs to achieve sublinear parallel time bounds while still maintaining  ...  However, a large class of dynamic programs with more than O(1) dependency achieve optimality either in space or time, but not both.  ...  to achieve sublinear parallel time bounds (or time bounds for short) [2] 1 .  ... 
doi:10.1145/3155284.3019029 fatcat:mn32tpt2lzbhrjuql54jttmsce

Nested Dataflow Algorithms for Dynamic Programming Recurrences with more than O(1) Dependency [article]

Yuan Tang
2019 arXiv   pre-print
In 1994, Galil and Park developed work-efficient and sublinear-time algorithms for several important dynamic programming problems based on the closure method and matrix product method.  ...  Dynamic programming problems have wide applications in real world and have been studied extensively in both serial and parallel settings.  ...  INTRODUCTION Dynamic Programming (DP) is a general problem-solving technique that solves a large problem optimally by recursively breaking down into sub-problems and solving those subproblems optimally  ... 
arXiv:1911.05333v1 fatcat:s2ftachyofabzpogg2co26m23e

Parallel computational optimization in operations research: A new integrative framework, literature review and research directions [article]

Guido Schryen
2019 arXiv   pre-print
Solving optimization problems with parallel algorithms has a long tradition in OR.  ...  This heterogeneity is accompanied by a lack of unifying frameworks for parallel optimization across methodologies, application fields and problems, and it has finally led to an overall fragmented picture  ...  An introduction into parallel dynamic programming is provided by Almeida et al. [2006] .  ... 
arXiv:1910.03028v1 fatcat:2h5dmsvqabgald5xdlbuvud5d4

Page 5372 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
It is the first optimal sublinear parallel time algorithm for this problem.  ...  Summary: “We design a sublinear time parallel algorithm for the computation of the general dynamic programming recurrences. Its total work matches the work of the best known sequential algorithm.  ... 

Page 5795 of Mathematical Reviews Vol. , Issue 93j [page]

1993 Mathematical Reviews  
for some dynamic programming problems.  ...  Summary: “This paper presents a sublinear parallel algorithm for dynamic programming problems such as computing an optimal or- der of matrix multiplications, an optimal binary search tree or an optimal  ... 

Parallel computational optimization in operations research: A new integrative framework, literature review and research directions

Guido Schryen
2019 European Journal of Operational Research  
Solving optimization problems with parallel algorithms has a long tradition in OR.  ...  This heterogeneity is accompanied by a lack of unifying frameworks for parallel optimization across methodologies, application fields and problems, and it has finally led to an overall fragmented picture  ...  On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed 0-1 problems under uncertainty. Top 23, 703-742.  ... 
doi:10.1016/j.ejor.2019.11.033 fatcat:5olyajxlyrca7kmqscpgjef4vq

Page 1851 of Mathematical Reviews Vol. , Issue 98C [page]

1998 Mathematical Reviews  
A general technique for parallelizing a class of dynamic-programming algorithms leads to an algorithm that runs in O(log’ n) time on a concurrent-read exclusive-write parallel random-access machine (CREW  ...  This problem can be solved using dynamic programming in O(n*) sequential time, but the best sequential algorithm known for this problem runs in O(nlogn) time.  ... 

Page 57 of Mathematical Reviews Vol. , Issue 94a [page]

1994 Mathematical Reviews  
Using only one of the algorithms would lead to a superlinear-time parallel algorithm, but a suitable combination produces a sublinear-time parallel algorithm.  ...  parallel algorithms for matching and related problems.  ... 

On the Sublinear Processor Gap for Parallel Architectures [chapter]

Alejandro López-Ortiz, Alejandro Salinger
2013 Lecture Notes in Computer Science  
various parallel algorithms.  ...  In the past, parallel algorithms were developed, for the most part, under the assumption that the number of processors is Θ(n) (where n is the size of the input) and that if in practice the actual number  ...  We would like to thank Daniel Remenik for helpful discussions. 204 A. López-Ortiz and A. Salinger  ... 
doi:10.1007/978-3-642-38236-9_18 fatcat:jd2o2dawgvgpzn7aimhfeohagu

Page 4211 of Mathematical Reviews Vol. , Issue 99f [page]

1999 Mathematical Reviews  
We present the first dynamic algorithm that achieves optimal query time, i.e., O(p+ occ), sublinear time per update, i.e, O(\/n+y), and optimal space, i.e., O(7), in the worst case.  ...  The authors find linear time algorithms for both problems.  ... 

Page 3368 of Mathematical Reviews Vol. , Issue 2001E [page]

2001 Mathematical Reviews  
In this paper, we show that the minimum weighted latency problem on some graphs can be solved in polynomial time by dynamic programming.  ...  The dynamic programming algorithm generalizes the previous results in the literature and includes some other cases.  ... 

Compiler Technology for Parallel Scientific Computation

Can Özturan, Balaram Sinharoy, Boleslaw K. Szymanski
1994 Scientific Programming  
Our approach is based on a program decomposition, parallel code synthesis, and run-time support for parallel scientific computation.  ...  In this article we discuss annotations, configurations, parallel code generation, and run-time support suitable for parallel programs written in the functional parallel programming language EPL and in  ...  Special thanks are also due to Louis Ziantz for assistance with running the EPL tests on the MasPar and to Joyce Brock for help in preparing the manuscript.  ... 
doi:10.1155/1994/243495 fatcat:v3abg7bkkzbmnix2w5kplpvyau

Scalable Locomotion for Large Self-Reconfiguring Robots

Robert Fitch, Zack Butler
2007 Engineering of Complex Computer Systems (ICECCS), Proceedings of the IEEE International Conference on  
The algorithm is inspired by reinforcement learning and uses dynamic programming to plan module paths in parallel.  ...  For large self-reconfiguring robots, any algorithm that requires linear amounts of memory per module (with respect to the number of modules) or linear time for computation or communication per actuation  ...  Special thanks go to fellow SMLKA Program members at NICTA for general discussion of the MDP formulation.  ... 
doi:10.1109/robot.2007.363654 dblp:conf/icra/FitchB07 fatcat:vvay2eicbnbmrduanih6lwx2ve

Page 2081 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
Then an algorithm based on dynamic programming that simulates these reduced NFAs is presented.  ...  of how the translation increases the running time of an algorithm.  ... 
« Previous Showing results 1 — 15 out of 2,246 results