List scheduling in the presence of branches. A theoretical evaluation (Q1128736)
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: List scheduling in the presence of branches. A theoretical evaluation |
scientific article; zbMATH DE number 1189977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | List scheduling in the presence of branches. A theoretical evaluation |
scientific article; zbMATH DE number 1189977 |
Statements
List scheduling in the presence of branches. A theoretical evaluation (English)
0 references
13 August 1998
0 references
instruction scheduling
0 references
performance guarantee
0 references
parallelizing compilers
0 references
0.7661730051040649
0 references
0.7433317303657532
0 references
0.7390560507774353
0 references
0.7352834939956665
0 references
