Some efficient solutions to the affine scheduling problem. II: Multidimensional time (Q1322507): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:11, 31 January 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
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
