Some efficient solutions to the affine scheduling problem. II: Multidimensional time (Q1322507): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient solutions to the affine scheduling problem. I: One- dimensional time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic translation of FORTRAN programs to vector form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dataflow analysis of array and scalar references / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal code parallelization using unimodular transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric integer programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01379404 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2983923412 / rank
 
Normal rank

Latest revision as of 09:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Some efficient solutions to the affine scheduling problem. II: Multidimensional time
scientific article

    Statements

    Some efficient solutions to the affine scheduling problem. II: Multidimensional time (English)
    0 references
    0 references
    5 May 1994
    0 references
    automatic parallelism detection
    0 references
    parallelizing compilers
    0 references
    divide and conquer
    0 references
    affine schedule
    0 references
    parallel complexity
    0 references
    multidimensional schedules
    0 references
    loop nests
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references