Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training
summary
The gist
Optical Circuit Switching (OCS) offers high bandwidth density and energy efficiency for LLM training, but incurs a non-negligible reconfiguration delay <ref:2609.25949#pg2> This paper presents Flux…
In short
Flux is a scheduler designed to optimally schedule optical circuit switches for Large Language Model (LLM) training. It moves beyond traditional methods by modeling compute and communication together in a Mixed Integer Linear Program (MILP). This approach reduces training iteration time by up to 10 times and drastically cuts peak network buffer requirements.
Key concepts
- Optical Circuit Switching (OCS)
- A technology that uses light beams to create dedicated, high-bandwidth paths through a network. It offers high bandwidth density for LLM training but introduces a delay when switching circuits, which Flux aims to minimize.
- Workload-Aware Scheduling
- The method of scheduling switches by considering the entire structure of the LLM training job, not just traffic demand. It treats compute and communication as a single problem to find the best overall execution order and circuit configuration.
- Mixed Integer Linear Program (MILP)
- A mathematical framework used by Flux to formally define the scheduling problem. It takes the system's accelerators and the workload as inputs, aiming to minimize total completion time while respecting physical constraints like reconfiguration delays.
- Directed Acyclic Graph (DAG)
- A way to represent the LLM training process where each task is a point-to-point send between accelerators. Edges in this graph encode dependencies, including the necessary compute time, which helps Flux determine the correct execution sequence.
Terminology used across episodes
This episode discusses
- Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training · Paper Radio
- The Llama 3 Herd of Models · Paper Radio
- Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelism
- Chakra: Advancing Performance Benchmarking and Co-design using Standardized Execution Traces
- Mission Apollo: Landing Optical Circuit Switching at Datacenter Scale
The paper
Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training · Read on arXiv
IDLab, University of Antwerp - imec
Transcript
Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.
Tom: I'm Tom.
Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.
Tom: We're looking at the paper: "Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training".
Paper summary: Tom: So, looking at the whole thing, the authors of Flux have developed a scheduler that optimally schedules optical circuit switches based on the structure of the entire workload <ref:2609.25949#pg4>. They’ve shown it can reduce training iteration time by up to ten times and peak NIC buffer requirements by more than three orders of magnitude compared to traditional periodic schedulers <ref:2609.25949#pg2>.
Jane: And the key thing here is that Flux achieves this because it schedules circuits together with the workload, allowing communication and reconfiguration to overlap with compute <ref:2609.25949#pg4>. It's not just about optimizing for traffic; it’s about aligning the network actions with the actual computation timeline <ref:2609.25949#pg3>.
Lu: The paper formalizes this by creating a Mixed Integer Linear Program that takes the system of accelerators and a specific workload as inputs, and its objective is to minimize the total completion time of that workload graph, defined as the minimum of the maximum time across all those points and vertices in the graph <ref:2609.25949#pg4>.
Meng: What this means for us is that we need to think about modeling our workloads in a way that captures these temporal dependencies accurately if we want to leverage these types of scheduling techniques <ref:2609.25949#pg7>. The authors are also looking ahead at turning Flux into a tool for scheduling large and realistic problem sizes, which includes designing intelligent heuristics and supporting MoE models <ref:2609.25949#pg4>.
Lalam: I think the paper really proves that considering the temporal structure of the workload is critical for achieving better efficiency in optical circuit switching for LLM training <ref:2609.25949#pg2>. It shows that what matters is whether a reconfiguration enables useful circuits <ref:2609.25949#pg4>.
Tom: So, the authors are showing that the separation between network scheduling and compute can be a fundamental inefficiency, and Flux addresses it by coupling them into one schedule <ref:2609.25949#pg3>. It’s a big step in making high-density optical networking practical for large scale AI training <ref:2609.25949#pg1>.
Jane: The implication is that we move beyond just looking at aggregate traffic to designing schedules that actively pipeline communication with computation, which really unlocks the potential of these systems <ref:2609.25949#pg3>.
Conclusion: Tom: So, Flux is about finding the best way to schedule those optical circuit switches for training large language models <ref:2609.25949#pg4>.
Jane: It’s essentially taking a big task—the whole workload of training—and figuring out how to map it onto the network hardware in a way that keeps everything running smoothly, even when the network has to reconfigure itself <ref:2609.25949#pg2>.
Lu: The authors use a mixed integer linear program to look at the entire training graph, including both how fast things compute and how they communicate <ref:2609.25949#pg4>. They’re minimizing the total time it takes for that whole training process to finish <ref:2609.25949#pg4>.
Meng: It sounds like they’re trying to make sure the network reconfiguration doesn't just sit there and cause delays while the AI accelerators are waiting for data <ref:2609.25949#pg1>. That idle time costs money at scale, so that matters to me <ref:2609.25949#pg4>.
Lalam: What they show is that when you schedule the network and the compute together, you can actually reduce iteration times by up to ten times and shrink those massive memory requirements for the NICs by more than three orders of magnitude <ref:2609.25949#pg2>.
Tom: Ten times faster iterations is a big number, but I want to know what they mean in practice for someone trying to deploy a model right now <ref:2609.25949#pg1>.
Jane: It means instead of waiting around for the network to catch up, the communication happens while the compute part is already working, which cuts down on those bottlenecks <ref:2609.25949#pg4>.
Lu: They’re basically saying that what really matters isn't how often you reconfigure a switch, but whether that reconfiguration lets you use the circuit in a useful way during the compute phase <ref:2609.25949#pg7>.
Meng: If this works well across different hardware, then it means we can actually move toward more efficient optical interconnects for massive AI training jobs <ref:2609.25949#pg4>.
Lalam: I'm confident that the connection between the workload structure and the network schedule is where the real power of this work is, especially when you think about scheduling huge models with many experts <ref:2609.25949#pg7>.
More episodes
- 2505.16254-Human-AI Writing as Distributed Cognition: Reassessing Collaborative Writing Theories in the Age of LLMs
- 2506.10913-Choreographic Quick Changes: First-Class Location (Set) Polymorphism
- 2507.14812-A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
- 2507.15448-Frames over finite fields with respect to the Galois inner product and their connections to self-orthogonal and LCD codes
- 2508.21572-NewsReX: An Open-Source Multi-Framework for Neural News Recommendation
- 2509.17028-Impact of Packetization on Network Calculus Analysis
- 2510.17342-AoA Services in 5G Networks: A Framework for Real-World Implementation and Systematic Testing
- 2511.04088-Efficient and rate-optimal list-decoding in the presence of minimal feedback
- 2511.17264-Notes on Stack Machines and Quantum Stack Machines
- 2601.15318-On the closest balanced game