← all workloads

module_link

n importable modules plus a main that imports and uses all of them. The harness precompiles each module to .slang-module, then compiles main against them, stressing module read + linkIR. Scaling null: n scales module count, each O(1); ideal load+link cost is O(n).

bucket: module_link  ·  mode: link  ·  flags: -target spirv -emit-spirv-directly

Phase composition vs N (stacked sub-counters)

compileInner split into phase buckets (named leaves + (self) residuals) stacked across the sweep sizes — the top edge is compileInner, so you can see which phase drives the scaling.

module_link — phase composition vs N (v2026.13.1, median ms) module_link 7.5× over N 50→400 0.0 226 452 50 100 200 400 N module_link — parseTranslationUnit module_link — SemanticChecking module_link — generateIR module_link — frontEndExecute (self) module_link — specializeModule module_link — simplifyIR module_link — linkIR module_link — unrollLoopsInModule module_link — legalizeResourceTypes module_link — legalizeExistentialTypeLayout module_link — performMandatoryEarlyInlining module_link — performForceInlining module_link — linkAndOptimizeIR (self) module_link — generateOutput (self) module_link — compileInner (self) phase buckets parseTranslationUnit SemanticChecking generateIR frontEndExecute (self) specializeModule simplifyIR linkIR unrollLoopsInModule legalizeResourceTypes legalizeExistentialTypeLayout performMandatoryEarlyInlining performForceInlining linkAndOptimizeIR (self) emitEntryPointsSourceFromIR generateOutput (self) compileInner (self)

Scaling analysis

floor-subtracted power-law fit (t − floor) = a·Nk; floor = the minimal workload (fixed per-compile cost), k the global exponent, top-2× the local high-end doubling ratio.

N rangefloor (ms)k (work)fit R²t(Nmin)t(Nmax)top-2×
50–400111.061.000564192.04×

Growth attribution (N=50 → N=400)

compileInner grows by 363 ms across the sweep; the mutually-exclusive phase buckets below partition that growth exactly (no nested-timer double counting). × lin is the same metric as the top-level panels, per bucket: the end point vs a linear expectation anchored to the bucket's share of the minimal floor and fitted on the low-N half — 1.0 = grew exactly linearly, >1 bends up. The super-linearity lives where × lin (and k) are red.

buckett@N=50t@N=400Δ msshare× lin∝Nk
SemanticChecking36284+24868%1.05×1.06
linkIR549+4512%1.30×1.15
generateOutput (self)526+226%1.22×1.11
simplifyIR215+134%0.99×0.96
linkAndOptimizeIR (self)214+123%1.02×0.97

Also growing (below top-5): specializeModule (+11 ms, 3%), generateIR (+9 ms, 3%).

Near-constant (≤2% of growth each): legalizeExistentialTypeLayout (0→1 ms), legalizeResourceTypes (0→1 ms), parseTranslationUnit (0→1 ms), frontEndExecute (self) (0→1 ms), performForceInlining (0→0 ms), performMandatoryEarlyInlining (0→0 ms), unrollLoopsInModule (0→0 ms), compileInner (self) (0→0 ms).

Sweep numbers (median ms)

NcompileInnerlinkIR
50565
10010710
20020522
40041949