00

Instruction Scheduling

Technique ☆ WATCH ⎘ SHARE

First seen 6/9/2026

Last seen 6/9/2026

Evidence 8 chunks

01

NEIGHBORHOOD

6 nodes · 8 edges

graph · Instruction Scheduling · depth=1

02

RELATIONSHIPS

5 connections

Constraint Programming ← implements 95% 2e evidence

Constraint programming is used to implement instruction scheduling.

Directed Acyclic Graph uses → 85% 2e evidence

Instruction scheduling uses DAG representations of basic blocks.

Code Generation for Custom Architectures using Constraint Programming ← uses 100% 1e evidence

Instruction scheduling is one of the code generation subproblems addressed in the thesis.

Instruction Level Parallelism uses → 90% 1e evidence

Instruction scheduling exploits instruction level parallelism to improve throughput.

Unison ← implements 90% 1e evidence

Unison combines instruction scheduling with other code generation subproblems.