Abstract
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. It is the first optimal sublinear parallel time algorithm for this problem. Using similar methods we construct also sublinear time parallel algorithms for the recognition of linear, unambiguous and deterministic cfl's. Their total works are O(T(n)αlog(n)), for arbitrarily small constant α<1, where T(n) is the work of the best known sequential algorithm for the problem. This reduces substantially the gap between the total work of sublinear time parallel algorithms and that of the best known sequential algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M.Atallah, R.Kosaraju, L.Larmore, G.Miller, Teng, Parallel tree construction, SPAA'89
L.Banachowski, A.Kreczmar, W.Rytter, Analysis of algorithms and data structures, Chapters 6–7, Addison Wesley (1991)
M.Chytil, B.Monien, Caterpillars and context free languages, STACS'90
M.Chytil, M.Crochemore, B.Monien, W.Rytter, On the parallel recognition of unambiguous context free languages, accepted to Theoretical Computer Science
A.Gibbons, W.Rytter, Efficient parallel algorithms, Cambridge University Press (1988)
A.Gibbons, W.Rytter, Optimal parallel algorithm for dynamic expression evaluation and context free recognition, Information and Computation (1989)
L.Guibas, H.Thompson, C.Thompson, Direct VLSI implementation of combinatorial algorithms, Caltech Conf. on VLSI (1979)
J.Hopcroft, J.Ullman, Introduction to automata, languages and computation, Addison Wesley (1979)
S.Huang, H.Liu, V.Viswanathan, A sublinear parallel algorithm for some dynamic programming problems, Int.Conf. on Parallel Processing 3 (1990) 261–264
S.R.Kosaraju. Speed of recognition of context-free language by array automata, SIAM J.Comp. 4 (1975) 333–340
P.Klein, J.Reif, Parallel time O(log n) acceptance of deterministic cfl's, SIAM Journal on Comp. 17 (19880, page 484
W.Rytter, Parallel time O(log n) recognition of unambiguous cfl's, Information and Computation 73 (1987) 315–322
W.Rytter, On the parallel computation of costs of paths on a grid graph, IPL 29 (1988) 71–74
W.Rytter, The complexity of two way pushdown automata and recursive programs, Combinatorial algorithms on texts (ed.A.Apostolico, R.Capocelli), Springer-Verlag (1985) 341–356
W.Rytter, Time complexity of unambiguous path systems, IPL 15:3 (1982)
V.Viswanathan, S.Huang, H.Liu, Parallel dynamic programming, IEEE Conf. on Parallel Processing (1990) 497–500
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larmore, L.L., Rytter, W. (1992). Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_178
Download citation
DOI: https://doi.org/10.1007/3-540-55210-3_178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55210-9
Online ISBN: 978-3-540-46775-5
eBook Packages: Springer Book Archive