mirror of
https://github.com/deepseek-ai/DeepInfer.git
synced 2026-10-29 07:17:08 +08:00
A world all-reduce costs ~3.2 ms per graph that holds one, whatever it carries (microbenchmark at 64 ranks: one all-reduce a graph 3.5 ms, ten chained in one graph 3.6 ms; fp32 / bf16 and 1 / 6 rows alike), so the step pays per collective-bearing graph, not per byte. The MoE's gate, experts, all-reduce and shared expert now stay one graph at decode sizes (prompt chunks still split). bench62 (512 in, TP=64, nextn=5): engine step 805 -> 740 ms. Random-token prompts make greedy outputs chaotic, so a graph-boundary change that moves bf16 rounding changes the generated tokens and the acceptance; the step time is the comparable figure. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> |
||
|---|---|---|
| .. | ||
| nki | ||
| vendor | ||
| __init__.py | ||
| fp8_guard.py | ||
| fp8.py | ||
| neuron_compile.py | ||
| NEURON_PORT.md | ||
| nki_attention.py | ||
| nki_gemm.py | ||
| nki_hc.py | ||
| nki_norm.py | ||
| nki_topk.py | ||
| op_census.py | ||
| regions.py | ||
| static_moe.py | ||
| transfer_to_neuron.py | ||