Some efficient solutions to the affine scheduling problem. I: One- dimensional time (Q687632): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Lucid / rank | |||
Normal rank | |||
Revision as of 06:46, 29 February 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
20 December 1993
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
