Partitions, relays, and capacity

For a finite declared register collection, choose sufficient local capacity and route names one at a time using unit-generator edges, keeping already delivered names stationary. This gives a routing construction in the schedule class. It does not show that every arbitrary fixed schedule routes.

A fair fixed schedule that repeats both matching phases of every generator is tail routing, but may have a different physical throughput. The distinction between schedule-class attainment and a fixed schedule's speed remains essential.