Abstract
This paper addresses general issues involved in parallelizing tabled evaluations by introducing a model of shared-memory parallelism which we call table-parallelism, and by comparing it to traditional models of parallelizing SLD. A basic architecture for supporting table-parallelism in the framework of the SLG-WAM[14] is also presented, along with an algorithm for detecting termination of subcomputations.
This work was partially supported by CAPES-Brazil and NSF grants CCR-9102159, CCR-9123200, CCR-9404921, CDA-9303181.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Banchilhon and R. Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proc. of SIGMOD 1986 Conf., pages 16–52. ACM, 1986.
R. Bol and L. Degerstedt. Tabulated resolution for the well-founded semantics. In Proc. ILPS'93 Workshop on Programming with Logic Databases. MIT Press, 1993.
W. Chen, T. Swift, and D.S. Warren. Efficient implementation of general logical queries. J. Logic Programming. To Appear.
W. Chen and D. S. Warren. Query evaluation under the well-founded semantics. In Proc. of 12th PODS, pages 168–179, 1993.
M. Codish and B. Demoen. Analysing logic programs using ‘prop'-ositional logic programs and a magic wand. In Proc. of the Int'l Symp. on Logic Programming, pages 114–130, 1993.
S. Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, K. Sagonas, S. Skiena, T. Swift, and D. S. Warren. Unification factoring for efficient execution of logic programs. In Proc. of the 22nd Symp. on Principles of Programming Languages. ACM, 1995.
S. Dawson, C.R. Ramakrishnan, and D.S. Warren. Using XSB for abstract interpretation. In Special Workshop on Abstract Interpretation, 1995. Eliat, Israel. To Appear.
E.W. Dijkstra, W.H.J Feijen, and A.J.M. van Gasteren. Derivation of a termination detection algorithm for distributed computations. Information Processing Letters, pages 217–219, June 1983.
J. Freire, R. Hu, T. Swift, and D.S. Warren. Exploiting parallelism in tabled evaluations. Technical report, SUNY at Stony Brook, 1995. Full version available at urhttp://www.cs.sunysb.edu/ sbprolog.
M. Hermenegildo and F. Rossi. On the correctness and efficiency of independent and-parallelism in logic programs. In N. Amer. Conf. on Logic Programming., 1989.
M. Heimenegildo and F. Rossi. Non-strict independent and-parallelism. In Logic Programming: Proc of the 5th Intl. Conf., pages 237–252, 1990.
H. Seki. On the power of Alexander templates. In Proc. of 8th PODS, pages 150–159. ACM, 1989.
P. Stuckey and S. Sudarshan. Well-founded ordered search. In 13th conference on Foundations of Software Technology and Theoretical Computer Science, pages 161–172, 1993.
T. Swift and D. S. Warren. An abstract machine for SLG resolution: definite programs. In Proceedings of the Symposium on Logic Programming, pages 633–654, 1994.
T. Swift and D. S. Warren. Analysis of sequential SLG evaluation. In Proceedings of the Symposium on Logic Programming, pages 219–238, 1994.
H. Tamaki and T. Sato. OLDT resolution with tabulation. In Third Int'l Conf. on Logic Programming, pages 84–98, 1986.
J. D. Ullman. Flux, sorting, and supercomputer organization for AI applications. Journal of Parallel and Distributed Computing, 1:133–151, 1984.
L. Vieille. Recursive query processing: The power of logic. Theoretical Computer Science, 69:1–53, 1989.
D.H.D. Warren. An abstract Prolog instruction set. Technical report, SRI, 1983.
D.H.D. Warren. Or-parallel models of Prolog. In Proceedings of the International Conference on Theory and Practice of Software Development. Springer-Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Freire, J., Hu, R., Swift, T., Warren, D.S. (1995). Exploiting parallelism in tabled evaluations. In: Hermenegildo, M., Swierstra, S.D. (eds) Programming Languages: Implementations, Logics and Programs. PLILP 1995. Lecture Notes in Computer Science, vol 982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026817
Download citation
DOI: https://doi.org/10.1007/BFb0026817
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60359-7
Online ISBN: 978-3-540-45048-1
eBook Packages: Springer Book Archive