-
One clip for both corners: area-only ranking wins 76 fast-corner designs and loses the one that matters
Choosing the clip alpha per process corner raises fast-corner regret from 2.98% to 3.62%; at tt, area-only ranking is 8 points worse.
-
Fifteen fresh add chains, no repeat of the miss: area-only ranking at the fast corner, tested blind
On 15 fresh short add chains at ff, area-only ranking has 6.15% regret against 7.18%, with no repeat of csum2's 66% miss; 1.25 still wins held out.
-
Does the chip-flow routing shortlist fail on adder chains at the fast corner? Blind test: weaker, not failing
20 fresh SKY130 designs at ff_n40C_1v95: the cheap routing shortlist loses on 3 of 10 adder chains and 0 of 10 others, with a smaller edge on adds.
-
Adder chains or short paths? Why a chip-flow routing shortlist weakens at the fast corner
A 2x2 test on 33 SKY130 designs at ff_n40C_1v95: the routing shortlist's edge shrinks on designs that map under 15 ns, whatever computes the shift.
-
A detector that has already paid: pre-routing signals for a chip-search shortlist at SKY130's fast corner
No mapped-pool signal flags where the clipped ladder loses at ff (3.61% against 2.98%); post hoc, ranking by area alone does better.
-
At the fast SKY130 corner the routed ranking scrambles further, and the routing shortlist still wins 20 of 27
27 blind SKY130 designs rerun at ff_n40C_1v95: tt and ff routed rankings share almost nothing, yet the cheap shortlist beats random routing 20 to 7.
-
Softening the fall-back does not save the guard: hedged fall-backs at SKY130's fast corner
Keeping part of the ladder when a pilot distrusts it lifts the break-even ratio from 0.17 to 0.24, well short of the 0.58 the pilots run at.
-
A pilot that sees the problem but cannot afford to act: a rank-check guard at SKY130's fast corner
On 77 SKY130 ff designs a pilot rank check raises the routing shortlist's regret from 2.98% to 4.21%, because falling back to random routing costs too much.
-
Adder chains or short paths? A fully fresh 2 x 2 says neither explains the routing shortlist's ff losses
20 fresh SKY130 designs at ff_n40C_1v95, crossed by amount structure and mapped delay: neither predicts where the cheap routing shortlist loses.
-
Denser placement, more designs: the routing shortlist wins 38 of 46 at 65% utilisation
26 more blind SKY130 designs at 65% placement utilisation: the cheap shortlist beats random routing 22 to 4, and its edge matches the 40% one.
-
Packing the chip tighter: the cheap routing shortlist keeps its edge at 65% utilisation
Twenty blind SKY130 designs rerun at 65% placement utilisation: routing gets dearer and the ranking moves, yet the ladder still beats random routing 16 to 4.
-
Finishing a cut-short chip-flow experiment: 13 of 15 more wins for the cheap ranking
The 15 SKY130 designs a time limit cut from a pre-registered blind test, run to completion: the clipped ladder wins 13, and 55 of 73 blind designs overall.
-
Where a cheap chip-flow ranking loses: near its switch threshold, not at the tight clock
A pre-registered replay on 99 SKY130 cells: the ladder's losses cluster near its cost threshold at both clocks, and raising the threshold saves nothing.
-
A slow library corner scrambles the routed ranking, and the routing shortlist still wins 24 of 27
27 blind SKY130 designs rerun at the ss_100C_1v60 corner: the best ABC sequence moves on 24 of 27, yet the cheap shortlist beats random routing 24 to 3.
-
28 wins or 13? Counting a chip-flow search rule's blind results by design, not by cell
On 42 blind SKY130 cells the clipped ladder beats random routing 28 to 8 (p = 0.001). By design it is 13 to 5 (p = 0.096); about 95 designs would settle it.
-
A confirmatory blind test of a cheap chip-flow ranking: 21 wins and 9 losses on 33 designs
Twelve new SKY130 designs, one clock each: the clipped ladder beats random routing on 8 and loses on 4. Pooled over 33 designs, p = 0.043.
-
Testing a fix that follows from the diagnosis: a delay check on the chip-flow ladder's top picks fails
Routing the ladder's top 3 and checking whether the smaller netlist is slower flags 47% of cells where the ladder is perfect, and 45% where it fails.
-
A cheap chip-flow ranking, tested blind on right and 256-bit shifters: 21 wins in 25, and the mean edge holds
On 25 new SKY130 designs the clipped ladder beats equal-cost random routing 21 to 4; over 58 blind designs its mean edge is -2.47 points, interval below zero.
-
Why a cheap chip-flow ranking fails: the area half is right, routing makes the small netlists slow
On 36 blind SKY130 cells, mapped area ranks routed area at tau 0.95, but where the ladder fails its picks route 3% to 27% slower than the optimum.
-
Chip design search: two guards for a misleading ranking, tested blind, and neither beats random routing
On six new 128-bit shifters run through Yosys and OpenROAD, a 32-gate rule has 2.25% regret and a pilot check 3.01%, against 2.20% for random routing.
-
Chip design search: a second spot-check cuts false alarms threefold and still loses on the mean
On 90 replayed Yosys and OpenROAD cells, confirming an alarm with a second random probe cuts false alarms from 12% to 4% but misses most true ones.
-
Chip design search: hedging a failed spot-check barely helps, because the check is the problem
On 90 replayed Yosys and OpenROAD cells, keeping three ranked candidates when a spot-check fails moves mean regret only from 4.39% to 4.37%.
-
Chip design search tested blind: the plain ranking beats random, and every guard costs more than it saves
On 7 new 128-bit shifters run through Yosys and OpenROAD, the unguarded ranking has 2.70% regret against 5.57% random; both guards lose to it.
-
Chip design search: a spot-check the schedule already pays for beats no check, narrowly
On 90 replayed Yosys and OpenROAD cells, checking a ranking against its own timing pilot cuts mean regret from 4.77% to 4.39%, yet loses on most cells.
-
Chip design search: a cheap ranking fails at its own top, so random spot checks miss it
Replayed on 90 Yosys and OpenROAD cells, a guard that spot-checks four random points does worse than no guard: 5.14% regret against 4.77%.
-
Chip design search: checking the ranking earlier buys the fall-back back, and the probes still cost too much
On 90 replayed Yosys and OpenROAD cells, a check on a 24-point subset cuts failing-cell regret from 16.6% to 9.2% but costs 4.2 points where ranking was right.
-
Chip design search: checking a cheap ranking at its top works, and still does not pay
On 90 replayed Yosys and OpenROAD cells, checking a ranking's top 3 flags failing cells in 54% of draws, yet the guard ends at 5.11% regret vs 4.77% unguarded.
-
Chip design search: four cells of logic in front of a shift amount are enough for a cheap ranking to work
Six new 128-bit shifters run blind through Yosys and OpenROAD: a cheap ranking wins once 4 or more cells feed the shift amount, not 8 as we guessed.
-
Chip design search: the cheap ranking starts to work at about 32 gates in front of a shift amount
Seven blind shifters run through Yosys and OpenROAD place the line at 31 to 33 gates in front of the shift amount, below the 36 we had registered.
-
Chip design search: the 32-gate rule for wide shifters failed its blind test
1,920 Yosys and OpenROAD runs on eight new shifters: the cheap ranking wins at 28 to 35 gates and loses at 36, so gate depth is not what decides it.
-
Chip design search: count the gates in front of a shift amount, not the operations
Six 128-bit shifters run blind through Yosys and OpenROAD: counting gates before the shift amount beats counting operations, 1.28% regret vs 5.33%.
-
Chip design search: where a shifter's amount comes from decides whether a cheap ranking works
Three shifter families run blind through Yosys and OpenROAD: a cheap ranking wins when a popcount drives the shift amount, and loses behind one adder.
-
Chip design search: a one-line RTL check fixes our shifter failure, run blind
An RTL check for data shifters of 64+ bits cut blind regret from 5.27% to 4.03% on three new circuit families, though it acted on only 3 of 12 cells.
-
Chip design search: our RTL shifter check fails its second blind test, and shows what the failure is
A barrel shifter built from muxes slips past our RTL check and costs 18-20% regret; a 128-bit normaliser it flags is where the cheap ranking wins outright.
-
Chip design search: a blind test on new circuit families breaks our rule, and shifters are why
On six chip designs from three new families, run blind, our clipped search rule had 8.34% regret against 2.48% for random routing; a funnel shifter caused it.
-
Chip design search: the free check we hoped would protect a fix did not
A guard meant to switch off a clipped mapped score on barrel shifters failed on 5 blind chip designs: 3.76% regret against 2.69% for the unguarded score.
-
Chip design search: count only the cells a rule had not seen, and the clip is what wins
On 24 cells of 12 chip designs run blind, a clipped mapped score beats equal-cost random routing in 18 (1.60% vs 2.91%); unclipped, it ties random.
-
Chip design search: the cheap score was ranking for speed the router would throw away
Routing stops at the clock, so mapped speed past it counts for nothing. Scoring that way cut search regret on 7 blind chip designs from 2.73% to 0.83%.
-
Chip design search: the cheap-estimate rule passes a fresh test where routing is expensive
On 1,440 new Yosys and OpenROAD runs, routing the 8 best mapped candidates cuts regret to a third of random routing where routing is dear.
-
Chip design search: a cost-ratio rule tested on eight designs it never saw
A cost-ratio rule fixed in advance gets 0.91% routed regret on eight unseen chip designs, against 2.64% for random routing at the same wall-clock.
-
Chip design search: a guard that worked in-sample and failed on fresh data
A guard read from the mapped netlist caught all five failing multiplier cells it was chosen on, then missed both fresh ones; regret rose from 0.97% to 1.16%.
-
Chip design search: time one run, then decide whether to trust the cheap estimate
On 26 held-out chip designs, using the cheap-estimate ladder only when routing costs over 3x a mapped score halves the regret of either fixed policy.
-
Chip design search: the cheap-estimate ladder pays only when routing is dear
On 26 chip designs it was never tuned on, a skip-the-cheap-rung search schedule beats random routing only where routing costs over 3x a mapped estimate.
-
Chip design search: the fair price of a cheap estimate
Priced at equal wall-clock on 2,400 real SKY130 flow runs, a multi-fidelity search schedule beats random routing only slightly, and a hand-picked one loses.
-
A cheap chip-design check that fails on ties: 2,400 fresh SKY130 runs
2,400 fresh Yosys and OpenROAD runs test a chip search schedule picked on old data. It held, and the reason is one design whose cheap scores tie.
-
Chip design search: when the cheap check is worse than no check
On ten small open-source chip designs, choosing a search schedule without peeking lands on 'skip the cheapest estimate'. The edge is small and we say so.
-
A certified chip-flow search is not a zero-regret one
On 20 SKY130 design-clock cells, a wider three-rung screening schedule loses 1.18% routed area-delay, against 2.27% for two rungs and 5.38% for random.
-
Does skipping the cheapest rung survive a smaller candidate pool?
Subsampling cached SKY130 place-and-route pools to 20, 30 and 40 points: scoring all at rung two and routing 8 stays slightly ahead of a wider schedule.
-
The first cut, not the rung scores, blocked a design-search guarantee
Correcting yesterday: widening the first keep certifies 18 of 20 three-rung chip design-search cells, against 8 with the first keep at a third of the pool.
-
Tuning every keep still leaves 12 of 20 search cells without a certificate
Widening both the middle and final keep in 20 three-rung chip design-search cells certifies a point in only 8, so the rung set binds, not the schedule.