Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (Q2931828)
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: Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra |
scientific article; zbMATH DE number 6374697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra |
scientific article; zbMATH DE number 6374697 |
Statements
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (English)
0 references
27 November 2014
0 references
affine scheduling
0 references
approximation algorithms
0 references
compiler optimizations
0 references
loop transformations
0 references
optimization
0 references
parallelism
0 references
0.8632102
0 references
0.85834026
0 references
0.8530542
0 references
0 references
0.8507501
0 references
0.85023546
0 references
0.84815395
0 references
0.84782547
0 references
0.8474529
0 references
0.8469171
0 references
