A methodology for granularity-based control of parallelism in logic programs (Q2365139): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jsco.1996.0038 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157542044 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JSCO.1996.0038 / rank
 
Normal rank

Latest revision as of 05:40, 18 December 2024

scientific article
Language Label Description Also known as
English
A methodology for granularity-based control of parallelism in logic programs
scientific article

    Statements

    A methodology for granularity-based control of parallelism in logic programs (English)
    0 references
    0 references
    0 references
    0 references
    22 October 1997
    0 references
    Several papers have investigated parallel executions of logic programs by defining suitable conditions ensuring correctness, i.e. ensuring that the parallel execution produces the same results as the sequential one. The implicit assumption underlying this approach is that parallel execution allow to obtain a significant speed-up wrt the sequential one. However, in practice this is not always true, since process creation, process scheduling and other overheads appearing in parallel execution can induce a slow-down. This paper introduce a methodology which allows to estimate and to control the granularity of parallel processes, so that parallelism can be limited and the effect of the overheads previously mentioned can be controlled. The approach is based on existing work and consists in the use of complexity functions at compile time to transform the original programs in such a way that the transformed programs automatically controls granularity. This allows to estimate the overhead due to parallel execution and also to obtain several compile-time and run-time optimization techniques.
    0 references
    Parallel execution
    0 references
    program transformation
    0 references
    overhead control
    0 references

    Identifiers