DART: Aiming for Tail-Delay Control in Reconfigurable Networks
Hossein Mohammadalizadeh, Holger Karl
Abstract
Many systems serve different job classes by switching among configurations. Often, reconfiguration takes a stochastic amount of time that depends on direction and can differ in distribution between configurations. Reaching a target configuration may require crossing intermediate ones. Under a high-percentile delay objective, rarely served or pass-through configurations accumulate the long-waiting jobs that dominate the sojourn-time tail. Controlling that tail couples three decisions: which target to choose, which path to take, and whether and how many jobs to serve at the configurations crossed on the way. We introduce DART, an opportunistic commitment policy that commits to a target configuration to avoid myopic detours while serving a traversed configuration only when its weighted delay or backlog justifies the pause. We show how these decisions shape the weighted sojourn-time tail. Across six stress topologies, each isolating a different tail-control challenge, DART achieves the lowest P99 sojourn time in every case, up to 23% below the strongest baseline. The advantage holds under heterogeneous, heavy-tailed, and asymmetric reconfiguration times.
Create a lesson
Related papers
Multi-Turn LLM Conversations under the Least-Recently-Used Policy: Mean-Field Asymptotics and Hit Ratio Approximation
Heyuan Yao, Chutong Gao, Yuan Lyu et al.
The Price of Remembering: A Calibrated Energy Law for Computation
Mohamed Amine Bergach
Spectral Analysis for Sparse Matrix Computation: Insights and Potential
Ruifeng Zhang, Xipeng Shen
Characterization of Request and Token Energy Costs for LLM Inference Workloads on GPU Platforms
Prabhu Vellaisamy, Vanessa Lam, Shawn Blanton et al.
FFSlim: An Efficient and Lightweight Format for Multi-modal Data Storage and Retrieval
Long Yang, Yu Mao, Yuchen Shao et al.
Adaptation Fidelity of SPEC CPU2026
Doa'a Al-Otoom, Mahesh Madhav