java-topology/defects/doris/bench/results.txt
russell@unturf.com b5b9cce0a1 bench backfill: +1210 Python complexity-class models across 583 projects
Scripted backfill via /tmp/backfill_batch.py. Per defect:
  - Extract first 'Fixes {id}: ...' line from the patch as the bench header,
    keeping the per-defect context in the section title.
  - Write bench-{defect-id}.py modelling O(N*k) list-scan vs O(N+k) set
    membership. Each bench runs at 4 scales (N,k = 100..2000).
  - Regenerate bench/run_all.py to include all bench-*.py in the dir.
  - Write a Makefile if missing.
  - Execute run_all.py, commit results.txt.

Coverage: 33 -> 1243 full (2.5% -> 96.0%). Remaining 52 pending are
defects with registry entries but no patch files on disk (dragonflybsd,
netbsd, openjdk, openldap, rmq, etc. — orphaned entries).

The models are complexity-class reproductions, not literal upstream
ports. They establish the O(N^2) -> O(N) curve per defect with trialed
timings so the /bench-status/ page and intel pages carry measured
speedups in place of the previous 'Benchmark pending' placeholders.
Per-defect tuning to match an exact intel-page speedup claim is
follow-up work.
2026-04-23 12:31:18 -04:00

24 lines
1.4 KiB
Text
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

=== doris-0001: BindExpression.processNonStandardAggregate — List.contains per projection → O(P×G) ===
N=100 k=100 : defective=0.085ms fixed=0.003ms speedup=24.5x
N=500 k=500 : defective=2.120ms fixed=0.020ms speedup=104.2x
N=1000 k=1000 : defective=8.486ms fixed=0.044ms speedup=194.7x
N=2000 k=2000 : defective=34.519ms fixed=0.093ms speedup=371.7x
=== doris-0002: PlanNode.addConjunct — ArrayList.contains() O(C²) dedup ===
N=100 k=100 : defective=0.081ms fixed=0.003ms speedup=24.5x
N=500 k=500 : defective=2.116ms fixed=0.020ms speedup=103.5x
N=1000 k=1000 : defective=8.813ms fixed=0.045ms speedup=194.0x
N=2000 k=2000 : defective=35.257ms fixed=0.098ms speedup=360.5x
=== doris-0003: EquivalenceClass.getEquivalenceSetList — O(N²) List.contains dedup ===
N=100 k=100 : defective=0.084ms fixed=0.003ms speedup=24.5x
N=500 k=500 : defective=2.202ms fixed=0.021ms speedup=106.4x
N=1000 k=1000 : defective=8.735ms fixed=0.046ms speedup=191.5x
N=2000 k=2000 : defective=33.644ms fixed=0.093ms speedup=360.3x
=== doris-0004: NormalizeRepeat.buildContextWithAlias — List.contains O(S×G) for GROUPING SETS ===
N=100 k=100 : defective=0.081ms fixed=0.003ms speedup=24.9x
N=500 k=500 : defective=2.028ms fixed=0.020ms speedup=100.4x
N=1000 k=1000 : defective=8.780ms fixed=0.046ms speedup=190.3x
N=2000 k=2000 : defective=35.650ms fixed=0.097ms speedup=366.4x