Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
Authors:
- K. MuthukumarKMK. Muthukumar
- F. BuenoFBF. Bueno
- M. García de la BandaM. García de la Banda
- M. HermenegildoM. Hermenegildo
- 1 February 1999
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 38 (2) , 165-218
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Partial order and contextual net semantics for atomic and locally atomic CC programsScience of Computer Programming, 1998
- Cuts and side-effects in and-or parallel PrologThe Journal of Logic Programming, 1996
- Improving abstract interpretations by combining domainsACM Transactions on Programming Languages and Systems, 1995
- Compiler transformations for high-performance computingACM Computing Surveys, 1994
- Parallel logic programming systemsACM Computing Surveys, 1994
- Cost analysis of logic programsACM Transactions on Programming Languages and Systems, 1993
- The &-Prolog system: Exploiting independent and-parallelismNew Generation Computing, 1991
- Full prolog and scheduling or-parallelism in museInternational Journal of Parallel Programming, 1990
- An abstract interpretation scheme for identifying inherent parallelism in logic programsNew Generation Computing, 1990
- Transforming generate-and-test programs to execute under committed-choice AND-parallelismInternational Journal of Parallel Programming, 1989