| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | New version of the algorithm that calculate the layout. | Mendes | 2022-09-21 | 1 | -9/+8 |
| | | | | | | | | | 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 | ||||
| * | Added the section with description proofs of the parametric assignment ↵ | Mendes | 2022-09-10 | 1 | -11/+247 |
| | | | | | computation in the optimal layout report | ||||
| * | ignore log files in commit | Mendes | 2022-09-08 | 1 | -0/+7 |
| | | |||||
| * | Added a first draft version of the algorithm and analysis for the non-strict ↵ | Mendes | 2022-08-19 | 1 | -2/+75 |
| | | | | | mode. | ||||
| * | Added the latex report on the optimal layout algorithm | Mendes | 2022-07-18 | 1 | -0/+394 |
 |
index : garage.git | |
| S3-compatible object store for small self-hosted geo-distributed deployments |
| aboutsummaryrefslogtreecommitdiff |