高可用存储中的磁盘布局算法
Algorithms for Replica Placement in High-Availability Storage
摘要：
提出了一种新的因果失效模型，并用于解决数据中心中的一个新的副本放置问题。该模型将系统组件之间的依赖关系描述为有向图。副本放置被定义为这样的图中的顶点的子集。形式化和解释了优化副本放置的标准。在这项工作中，优化的目标是避免选择放置在一个单一的故障事件可能会消灭多个副本。利用该准则，给出了依赖模型为树的情况下的快速算法。本文的主要贡献是一个$O(n + ρ\log ρ)$动态规划算法放置$ρ$副本的树与$n$顶点。该算法具有一个有趣的性质，即在每个阶段只需要递归地考虑两个子问题。文中还简要介绍了一个$O(n^2 ρ)$贪心算法。
英文摘要：
A new model of causal failure is presented and used to solve a novel replica placement problem in data centers. The model describes dependencies among system components as a directed graph. A replica placement is defined as a subset of vertices in such a graph. A criterion for optimizing replica placements is formalized and explained. In this work, the optimization goal is to avoid choosing placements in which a single failure event is likely to wipe out multiple replicas. Using this criterion, a fast algorithm is given for the scenario in which the dependency model is a tree. The main contribution of the paper is an $O(n + ρ\log ρ)$ dynamic programming algorithm for placing $ρ$ replicas on a tree with $n$ vertices. This algorithm exhibits the interesting property that only two subproblems need to be recursively considered at each stage. An $O(n^2 ρ)$ greedy algorithm is also briefly reported.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
