Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs

Authors:
Amadeo Casas;Manuel Carro;Manuel V. Hermenegildo
Affiliations:
Depts. of Comp. Science and Electr. and Comp. Eng., Univ. of New Mexico, USA;School of Computer Science, Universidad Politécnica de Madrid, Spain;Depts. of Comp. Science and Electr. and Comp. Eng., Univ. of New Mexico, USA and School of Computer Science, Universidad Politécnica de Madrid, Spain
Venue:
Logic-Based Program Synthesis and Transformation
Year:
2008

Citing 16
Cited 2

Designing a high performance parallel logic programming system

ACM SIGARCH Computer Architecture News
The Aurora or-parallel Prolog system

New Generation Computing - Selected papers on parallel logic programming from the International Conference on Fifth Generation Computer Systems, 1988
Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism

PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
The Muse Or-parallel Prolog model and its performance

Proceedings of the 1990 North American conference on Logic programming
ACE: and/or-parallel copying-based execution of logic programs

Proceedings of the eleventh international conference on Logic programming
A methodology for granularity-based control of parallelism in logic programs

Journal of Symbolic Computation - Special issue on parallel symbolic computation
Effectivness of abstract interpretation in automatic parallelization: a case study in logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallelizing irregular and pointer-based computations automatically: perpectives from logic and constraint programming

Parallel Computing - special issue on parallel computing for irregular applications
Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Comparison of 12 Parallel FORTRAN Dialects

IEEE Software
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Towards a high-level implementation of execution primitives for unrestricted, independent and-parallelism

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Determinacy analysis for logic programs using mode and type information

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Combining static analysis and profiling for estimating execution times

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
Improving the efficiency of nondeterministic independent and-parallel systems

Computer Languages

A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A segment-swapping approach for executing trapped computations

PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two new algorithms which perform automatic parallelization via source-to-source transformations. The objective is to exploit goal-level, unrestrictedindependent and-parallelism. The proposed algorithms use as targets new parallel execution primitives which are simpler and more flexible than the well-known &/2parallel operator. This makes it possible to generate better parallel expressions by exposing more potential parallelism among the literals of a clause than is possible with &/2. The difference between the two algorithms stems from whether the order of the solutions obtained is preserved or not. We also report on a preliminary evaluation of an implementation of our approach. We compare the performance obtained to that of previous annotation algorithms and show that relevant improvements can be obtained.