2 papers
cs.DS2024
Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
Harald Räcke, Stefan Schmid, Ruslan Zabrodin
Resource allocation in distributed and networked systems such as the Cloud is becoming increasingly flexible, allowing these systems to dynamically adjust toward the workloads they…
cs.DS2023
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
Harald Räcke, Stefan Schmid, Ruslan Zabrodin
The performance of many large-scale and data-intensive distributed systems critically depends on the capacity of the interconnecting network. This paper is motivated by the vision…