MoonshotAI / MoonshotAI/MoonEP
[QST] What is the typical token load (S) used in the e2e benchmark?
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 1.1k
- Forks
- 134
- PR merge metrics
- No merged PRs in 30d
Description
Hi authors, thanks for your great work. The idea of dynamic balanced EP is rather intriguing.
The README shows an end-to-end training benchmark comparing MoonEP vs DeepEP v2 on H20 with EP=8, sweeping maxvio. However, it does not state the number of input tokens per rank S (or equivalently,
global batch size / sequence length) used in that benchmark.
This matters because MoonEP's benefit model is:
- Benefit: eliminating compute hotspots caused by routing imbalance
- Cost: NVLink-based weight prefetch (bandwidth ~450 GB/s on H20) vs. local HBM reads (~4 TB/s)
If I understand correctly, at small S (few tokens per expert), the workload is memory-bound on expert weights. In that regime, prefetching weights over NVLink is strictly more expensive than reading them locally, and there is
little compute imbalance to eliminate. The crossover point where MoonEP's balance benefit outweighs its prefetch cost depends directly on S.
Questions:
- What value of
S(tokens per rank) was used in the e2e benchmark? - Was the benchmark run in a compute-bound or memory-bound regime per expert?
- Is there data or a rough estimate for the minimum
Sbelow which MoonEP's overhead exceeds its benefit (i.e., the break-even point)?
This would help users decide whether MoonEP is appropriate for their workload, particularly for inference or small-batch training scenarios.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the README’s end-to-end benchmark section and trace the benchmark configuration or results that define EP=8 and the maxvio sweep. Confirm the tokens per rank, whether the workload is compute- or memory-bound, and any break-even estimate; done means these values and their scope are documented for users.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- distributed-systems, performance
- Issue type
- Documentation
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 38/100