Some efficient solutions to the affine scheduling problem. I: One- dimensional time (Q687632)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some efficient solutions to the affine scheduling problem. I: One- dimensional time |
scientific article; zbMATH DE number 436431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some efficient solutions to the affine scheduling problem. I: One- dimensional time |
scientific article; zbMATH DE number 436431 |
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
0.8992194533348083
0 references
0.8989445567131042
0 references
0.8626583814620972
0 references
0.8409523367881775
0 references
