Exploiting Parallelism in Tabled Evaluations

作者: Juliana Freire , Rui Hu , Terrance Swift , David S. Warren

DOI: 10.1007/BFB0026817

关键词:

摘要: This paper addresses general issues involved in parallelizing tabled evaluations by introducing a model of shared-memory parallelism which we call table-parallelism, and comparing it to traditional models SLD. A basic architecture for supporting table-parallelism the framework SLG-WAM[14] is also presented, along with an algorithm detecting termination subcomputations.

参考文章(17)
David S. Warren, Terrance Swift, An abstract machine for SLG resolution: definite programs international conference on logic programming. pp. 633- 652 ,(1994)
Bart Demoen, Michael Codish, Analysing logic programs using “prop”-ositional logic programs and a magic wand international conference on logic programming. pp. 114- 129 ,(1993)
Francesca Rossi, Manuel V. Hermenegildo, On the correctness and efficiency of independent and-parallelism in logic programs conference on logic programming. pp. 369- 389 ,(1989)
Hisao Tamaki, Taisuke Sato, OLD resolution with tabulation international conference on logic programming. pp. 84- 98 ,(1986) , 10.1007/3-540-16492-8_66
Francesca Rossi, Manuel Hermenegildo, Non-strict independent and-parallelism international conference on lightning protection. pp. 237- 252 ,(1990)
Peter J. Stuckey, S. Sudarshan, Well-Founded Ordered Search (Extended Abstract) foundations of software technology and theoretical computer science. pp. 161- 172 ,(1993) , 10.1007/3-540-57529-4_51
Roland Bol, Lars Degerstedt, Tabulated resolution for the well-founded semantics Journal of Logic Programming. ,vol. 34, pp. 67- 109 ,(1998) , 10.1016/S0743-1066(97)00073-3
S. Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, K. Sagonas, S. Skiena, T. Swift, D. S. Warren, Unification factoring for efficient execution of logic programs Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95. pp. 247- 258 ,(1995) , 10.1145/199448.199509
Jeffrey D. Ullman, Flux, sorting, and supercomputer organization for AI applications Journal of Parallel and Distributed Computing. ,vol. 1, pp. 133- 151 ,(1984) , 10.1016/0743-7315(84)90002-9
Edsger W. Dijkstra, W.H.J. Feijen, A.J.M. van Gasteren, Derivation of a termination detection algorithm for distributed computations Information Processing Letters. ,vol. 16, pp. 217- 219 ,(1983) , 10.1016/0020-0190(83)90092-3