Non-strict independence-based program parallelization using sharing and freeness information

DOI10.1016/j.tcs.2009.07.044zbMath1187.68123OpenAlexW2113824364MaRDI QIDQ1035704

Manuel V. Hermenegildo, Daniel Cabeza Gras

Publication date: 4 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://oa.upm.es/5368/

zbMATH Keywords

parallelismlogic programmingparallelizing compilersabstract interpretationabstract domainsautomatic parallelizationdeclarative languagesnon-strict independencesharing and freeness

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Logic programming (68N17)

Related Items (2)

Parallel Logic Programming: A Sequel ⋮ Annotation of logic programs for independent AND-parallelism by partial evaluation

Uses Software

• Ciao
• CiaoPP
• SICStus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of success patterns in logic programs
• Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
• Pair-independence and freeness analysis through linear refinement.
• A methodology for granularity-based control of parallelism in logic programs
• Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
• On the design of a correct freeness analysis for logic programs
• Lazy Set-Sharing Analysis
• Static analysis of logic programs for independent and parallelism
• Compile-time derivation of variable dependency using abstract interpretation
• 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
• Soundness, idempotence and commutativity of set-sharing
• A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
• Logic Programming
• Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
• A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism

This page was built for publication: Non-strict independence-based program parallelization using sharing and freeness information