List Scheduling

CS 432 — Dependence graphs · Priorities · Cycle-by-cycle scheduling
Generated with the assistance of Claude Code (Opus 5.5)
— ← / → step · Home / End · click an instruction or a node to see it start

Listing

The block in its original order, lettered as on the slides, with each instruction's latency, priority, and the cycles it starts and finishes in. Gold is this step's instruction.

No traces loaded — run make regen in tracer/

Cycle Table

Slides 10 and 17's table: what is ready, what starts (with the cycle it finishes in), and what finishes at the end of each cycle.

Highlights

The latencies and the tie-breaker are this demo's model (single issue; loads and stores 3, mult 2, div 4, all else 1). An edge waits for its source's latency, except a write-after-read edge, which waits 1 cycle.