Bidirectional Resource Scheduling for Disaggregated and Asynchronous RL Post-Training
Not on the map. Why?
Abstract (arXiv)
It is well established that the reasoning capabilities of large language models (LLMs) can be improved by applying reinforcement learning (RL) in a post-training stage. In a standard RL iteration, the current model (the policy) generates experience through rollouts, and the resulting data is then used to update the policy during training. High-performance RL frameworks such as StreamRL and AReaL employ a disaggregated architecture and asynchronous rollouts to better exploit both rollout and training resources, thereby increasing overall system throughput. Nonetheless, across varying RL setups (e.g., hardware configurations, model scales, staleness levels, and hyperparameters) and under changing workloads, it remains common for both rollout and training resources to experience idle periods. In this paper, we present BiDiRL, a hybrid time-space multiplexing architecture for asynchronous, disaggregated RL designed to reduce resource idleness. First, we develop a hot-switch runtime that enables rapid switching between rollout and training resources with negligible overhead. Second, we propose a static, scheduling-aware planner based on time-performance modeling that chooses a hot-switch-friendly resource partition, so that rollout and training durations are roughly balanced at a coarse level. Third, at execution time, we introduce a bidirectional scheduler that further exploits runtime bubbles through fine-grained resource switching, allowing the bottleneck stage to temporarily borrow idle resources from the other pool. Across a wide range of workloads, datasets, and models on two 32-GPU testbeds, BiDiRL increases RL training throughput by up to 1.94x compared with RL systems including veRL, AReaL, and ROLL, without affecting convergence behavior.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Jul 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Deconstructing Off-Policy Ratios: Entropy-Normalized Trust Regions for Asynchronous Reinforcement Learningcited by 0
- 2026LeanGRPO: Eliminating Redundant Recomputation in Diffusion RLcited by 0
- 2026BRACE: Anchored Bellman-Residual Correction for Stale Critics in Asynchronous RLcited by 0
- 2026Rollout Efficiency in Reinforcement Learning for Reasoning Large Language Models: A Taxonomy and Future Directionscited by 0
- 2026PEARL: Adaptive Prefill-Decode Execution with Elasticity for Agentic Reinforcement Learningcited by 0
- 2026PEARL: Adaptive Prefill-Decode Execution with Elasticity for Agentic Reinforcement Learning28 Sep 2026
- 2026Rollout Efficiency in Reinforcement Learning for Reasoning Large Language Models: A Taxonomy and Future Directions21 Sep 2026
- 2026BRACE: Anchored Bellman-Residual Correction for Stale Critics in Asynchronous RL9 Sep 2026
- 2026LeanGRPO: Eliminating Redundant Recomputation in Diffusion RL3 Sep 2026
- 2026Deconstructing Off-Policy Ratios: Entropy-Normalized Trust Regions for Asynchronous Reinforcement Learning24 Jul 2026