
















Abstract:We present JigsawRL, a cost-efficient framework that explores Pipeline Multiplexing as a new dimension of RL parallelism. JigsawRL decomposes each pipeline into a Sub-Stage Graph that exposes the intra-stage and inter-worker imbalance hidden by stage-level systems. On this abstraction, JigsawRL resolves multiplexing interference through dynamic resource allocation, eliminates fragmented utilization by migrating long-tail rollouts across workers, and formulates their coordination as a graph scheduling problem solved with a look-ahead heuristic. On 4-64 H100/A100 GPUs across different agentic RL pipelines and models, JigsawRL achieves up to 1.85x throughput over Verl on synchronous RL, 1.54x over StreamRL and AReaL on asynchronous RL, and supports heterogeneous pipelines with moderate latency trade-off.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2604.23838 [cs.LG] |
| (or arXiv:2604.23838v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2604.23838 arXiv-issued DOI via DataCite (pending registration) |
From: Zhengding Hu [view email]
[v1]
Sun, 26 Apr 2026 18:45:31 UTC (967 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。