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

From MaRDI portal
Revision as of 02:47, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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