The Load-Balance Problem Behind Hybrid Parallelism
The article discusses the challenges of load balancing in hybrid parallelism systems, particularly focusing on the interaction between data parallelism (DP) and model parallelism (CP). It highlights how variable sequence lengths complicate scheduling and optimization in these systems. The piece also introduces solutions like Megatron Dynamic-CP and ByteScale's Hybrid Data Parallelism to improve efficiency in handling these complexities.
- ▪Variable sequence length complicates hybrid parallelism by turning it into a scheduling problem.
- ▪Megatron Dynamic-CP and ByteScale's Hybrid Data Parallelism offer solutions to improve load balancing.
- ▪The interaction between DP, CP, and pipeline parallelism (PP) cannot be optimized independently.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Github |
| Canonical URL | https://hecate0821.github.io/blogs/hybrid-parallel-post-training/ |
| Publication time | Fri, 29 May 2026 18:07:05 +0000 |
| Retrieval time | 2026-05-29T18:20:02.626Z |
| Last seen | 2026-05-29T18:20:02.626Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | d4g305cVab50 |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
systems note post-training systems DP+CP load balance The Load-Balance Problem Behind Hybrid Parallelism TL;DR: variable sequence length turns hybrid parallelism into a scheduling problem. Megatron Dynamic-CP improves a fixed DPxCP pool by choosing CP size per sequence inside a packed batch, while ByteScale's Hybrid Data Parallelism goes further by scheduling a more flexible rank pool. The main lesson is that DP, CP, and PP cannot be optimized independently once load balance and communication are both in the loop. 1. The 5D Map Is Really a Coupling Map DPSplits samples across ranks, then synchronizes gradients. CPSplits one sequence across ranks, mainly to make long attention fit. TP + SPSplits layer tensors and some sequence-dimension activations. PPSplits layers into pipeline stages.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Github.
Discussion
0 commentsMore from Github
