Some efficient solutions to the affine scheduling problem. II: Multidimensional time (Q1322507): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some efficient solutions to the affine scheduling problem. I: One- dimensional time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automatic translation of FORTRAN programs to vector form / 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: Optimal code parallelization using unimodular transformations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818127 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parametric integer programming / rank | |||
Normal rank | |||
Revision as of 15:36, 22 May 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
