This paper presents an optimal algorithm to compute the assignment of data to storage nodes in the Garage geo-distributed storage system. We discuss the complexity of the different steps of the algorithm and metrics that can be displayed to the user.

翻译：本文提出了一种最优算法，用于计算Garage地理分布式存储系统中数据到存储节点的分配方案。我们讨论了算法各步骤的复杂性以及可向用户展示的度量指标。