arXiv (All)
open access
Learning Adaptive SED for heterogeneous load balancing
We study a two-server load balancing system with heterogeneous service rates that are a priori unknown to the dispatcher. The goal is to route customers according to the Shortest--Expected--Delay (SED) policy, but this requires knowledge of the service rates. Empirical policies that route based on e
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- FreeBalance: Pre-Routing Online Moe Load Balancing via Residual Workload Prediction#458300
- Load Balancing for Machine Learning Platform in Heterogeneous Distribute Computing Environment#626259
- PEARL: Adaptive Prefill-Decode Execution with Elasticity for Agentic Reinforcement Learning#1129755
- Pareto-Optimal Scheduling in the Half-batch Multiserver-job Model#1070872
- DHC Load Balancing Algorithm#158872
Record · ID 974960
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive