Some efficient solutions to the affine scheduling problem. I: One- dimensional time (Q687632): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PipLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Lucid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing systolic arrays from recurrence equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel execution of DO loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal code parallelization using unimodular transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mapping uniform loop nests onto distributed memory architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / 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: Q4040908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Organization of Computations for Uniform Recurrence Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of recurrence equations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:20, 22 May 2024

scientific article
Language Label Description Also known as
English
Some efficient solutions to the affine scheduling problem. I: One- dimensional time
scientific article

    Statements

    Some efficient solutions to the affine scheduling problem. I: One- dimensional time (English)
    0 references
    0 references
    0 references
    20 December 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automatic parallelization
    0 references
    automatic systolic array design
    0 references
    systems of recurrence equations
    0 references
    precedence constraints
    0 references
    closed form schedules
    0 references
    parametric linear program
    0 references
    0 references
    0 references