Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
From MaRDI portal
Recommendations
- Annotation of logic programs for independent AND-parallelism by partial evaluation
- Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
- AND parallelism and nondeterminism in logic programs
- Static analysis of logic programs for independent and parallelism
Cites work
- scientific article; zbMATH DE number 683350 (Why is no real title available?)
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
- A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
- Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
- Determinacy Analysis for Logic Programs Using Mode and Type Information
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Overview of DASWAM: Exploitation of dependent and-parallelism
- Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
- Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
Cited in
(5)- Parallel Logic Programming: A Sequel
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
- Non-strict independence-based program parallelization using sharing and freeness information
- Annotation of logic programs for independent AND-parallelism by partial evaluation
This page was built for publication: Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504598)