List scheduling in the presence of branches. A theoretical evaluation (Q1128736): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q130471519, #quickstatements; #temporary_batch_1731347681068 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4131987 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130471519 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:54, 11 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | List scheduling in the presence of branches. A theoretical evaluation |
scientific article |
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
