Online Bisection with Ring Demands

arXiv:2602.10337v1 Announce Type: new
Abstract: The online bisection problem requires maintaining a dynamic partition of $n$ nodes into two equal-sized clusters. Requests arrive sequentially as node pairs. If the nodes lie in different clusters, the algorithm pays unit cost. After each request, the algorithm may migrate nodes between clusters at unit cost per node. This problem models datacenter resource allocation where virtual machines must be assigned to servers, balancing communication costs against migration overhead.
We study the variant where requests are restricted to edges of a ring network, an abstraction of ring-allreduce patterns in distributed machine learning. Despite this restriction, the problem remains challenging with an $Omega(n)$ deterministic lower bound. We present a randomized algorithm achieving $O(varepsilon^{-3} cdot log^2 n)$ competitive ratio using resource augmentation that allows clusters of size at most $(3/4 + varepsilon) cdot n$.
Our approach formulates the problem as a metrical task system with a restricted state space. By limiting the number of cut-edges (i.e., ring edges between clusters) to at most $2k$, where $k = Theta(1/varepsilon)$, we reduce the state space from exponential to polynomial (i.e., $n^{O(k)}$). The key technical contribution is proving that this restriction increases cost by only a factor of $O(k)$. Our algorithm follows by applying the randomized MTS solution of Bubeck et al. [SODA 2019].
The best result to date for bisection with ring demands is the $O(n cdot log n)$-competitive deterministic online algorithm of Rajaraman and Wasim [ESA 2024] for the general setting. While prior work for ring-demands by R”acke et al. [SPAA 2023] achieved $O(log^3 n)$ for multiple clusters, their approach employs a resource augmentation factor of $2+varepsilon$, making it inapplicable to bisection.