Deuxfleurs/garage
48
56
Fork 73
Code Issues 99 Pull requests 13 Releases 30 Wiki Activity

layout doc: reformulate
All checks were successful
continuous-integration/drone/pr Build is passing
Details
continuous-integration/drone/push Build is passing
Details

Browse source
This commit is contained in:
Alex 2023-09-22 16:09:17 +02:00
parent 8d07888fa2
commit 0e5925fff6
1 changed files with 8 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
doc/book/operations/layout.md
View file

@ -94,12 +94,13 @@ follow the following recommendations:
## Understanding unexpected layout calculations ## Understanding unexpected layout calculations
When adding, removing or modifying nodes in a cluster layout, sometimes When adding, removing or modifying nodes in a cluster layout, sometimes
unexpected assigntations of partitions to node can occure. These assignations unexpected assigntations of partitions to node can occur. These assignations
are in fact normal and logical, given the objectives of the algorihtm. Indeed, are in fact normal and logical, given the objectives of the algorihtm. Indeed,
**the layout algorithm prioritizes moving less data between nodes over the fact **the layout algorithm prioritizes moving less data between nodes over the fact
of achieving equal distribution of load**. This section presents two examples of achieving equal distribution of load. It also tries to use all links between
and illustrates how one can control Garage's behavior to obtain the desired pairs of nodes in equal proportions when moving data.** This section presents
results. two examples and illustrates how one can control Garage's behavior to obtain
the desired results.
### Example 1 ### Example 1
@ -266,8 +267,8 @@ This explains why node3 ends with 75% utilization (100% from before minus 25%
that is moved to node1), and node4 ends with 25% (50% from before minus 25% that is moved to node1), and node4 ends with 25% (50% from before minus 25%
that is moved to node1). that is moved to node1).
This illustrates another principle of the layout computation: **if there is a This illustrates the second principle of the layout computation: **if there is
choice in moving data out of some nodes, then all links between pairs of nodes a choice in moving data out of some nodes, then all links between pairs of
are used in equal proportions** (this is approximately true, there is nodes are used in equal proportions** (this is approximately true, there is
randomness in the algorihtm to achieve this so there might be some small randomness in the algorihtm to achieve this so there might be some small
fluctuations, as we see above). fluctuations, as we see above).