forked from Deuxfleurs/garage
Mendes
7f3249a237
It takes as paramters the replication factor and the zone redundancy, computes the largest partition size reachable with these constraints, and among the possible assignation with this partition size, it computes the one that moves the least number of partitions compared to the previous assignation. This computation uses graph algorithms defined in graph_algo.rs |
||
|---|---|---|
| .. | ||
| book | ||
| logo | ||
| optimal_layout_report | ||
| sticker | ||
| talks | ||