Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
DOI10.1016/S0167-8191(00)00051-XzbMATH Open0948.68024OpenAlexW2090115207WikidataQ126311230 ScholiaQ126311230MaRDI QIDQ1583370FDOQ1583370
Publication date: 26 October 2000
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(00)00051-x
Recommendations
abstract interpretationcost analysisautomatic parallelizationgranularity controlirregular computationspointer aliasing analysis
Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cited In (9)
- Past and present (and future) of parallel and distributed computation in (constraint) logic programming
- Parallel Logic Programming: A Sequel
- Automatic parallelization of irregular applications
- 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
- Fifty Years of Prolog and Beyond
- Title not available (Why is that?)
- Three improvements to the top-down solver
Uses Software
This page was built for publication: Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583370)