aboutsummaryrefslogtreecommitdiff
path: root/src/rpc/graph_algo.rs
Commit message (Collapse)AuthorAgeFilesLines
* new layout: use deterministic randomness for reproducible resultsAlex Auvolat2023-09-211-2/+6
|
* new layout: fix clippy lintsAlex Auvolat2023-09-181-4/+4
|
* Changed all instances of assignation to assignment.Jonathan Davies2023-01-051-2/+2
|
* Use bytes as capacity unitsAlex Auvolat2022-11-071-17/+17
|
* Style improvementsAlex Auvolat2022-11-071-141/+132
|
* Added some commentMendes2022-10-111-40/+39
|
* cargo fmtMendes2022-10-101-377/+377
|
* Tests written in layout.rsMendes2022-10-101-14/+0
| | | | | added staged_parameters to ClusterLayout removed the serde(default) -> will need a migration function
* corrected warnings of cargo clippyMendes2022-10-061-13/+13
|
* Correction of a few bugs in the tests, modification of ClusterLayout::checkMendes2022-09-221-23/+18
|
* New version of the algorithm that calculate the layout.Mendes2022-09-211-0/+440
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