aboutsummaryrefslogtreecommitdiff
path: root/doc/book/operations/layout.md
diff options
context:
space:
mode:
authorArmaël Guéneau <armael.gueneau@ens-lyon.org>2024-01-27 14:51:15 +0100
committerArmaël Guéneau <armael.gueneau@ens-lyon.org>2024-01-27 14:51:15 +0100
commit91a51dd3e876bde7d9b6199b478c26c620994348 (patch)
tree6db80499bd2d9531aeedc6a294d16f151f495ee0 /doc/book/operations/layout.md
parent08a871390e44751eb03f75189aa40ea2f84a9ffb (diff)
downloadgarage-91a51dd3e876bde7d9b6199b478c26c620994348.tar.gz
garage-91a51dd3e876bde7d9b6199b478c26c620994348.zip
doc: fix some typos
Diffstat (limited to 'doc/book/operations/layout.md')
-rw-r--r--doc/book/operations/layout.md12
1 files changed, 6 insertions, 6 deletions
diff --git a/doc/book/operations/layout.md b/doc/book/operations/layout.md
index ee05aba1..cf1372b0 100644
--- a/doc/book/operations/layout.md
+++ b/doc/book/operations/layout.md
@@ -13,7 +13,7 @@ In Garage, all of the data that can be stored in a given cluster is divided
into slices which we call *partitions*. Each partition is stored by
one or several nodes in the cluster
(see [`replication_mode`](@/documentation/reference-manual/configuration.md#replication_mode)).
-The layout determines the correspondence between these partition,
+The layout determines the correspondence between these partitions,
which exist on a logical level, and actual storage nodes.
## How cluster layouts work in Garage
@@ -94,10 +94,10 @@ follow the following recommendations:
## Understanding unexpected layout calculations
When adding, removing or modifying nodes in a cluster layout, sometimes
-unexpected assigntations of partitions to node can occur. These assignations
-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
-of achieving equal distribution of load. It also tries to use all links between
+unexpected assignations of partitions to node can occur. These assignations
+are in fact normal and logical, given the objectives of the algorithm. Indeed,
+**the layout algorithm prioritizes moving less data between nodes over
+achieving equal distribution of load. It also tries to use all links between
pairs of nodes in equal proportions when moving data.** This section presents
two examples and illustrates how one can control Garage's behavior to obtain
the desired results.
@@ -270,5 +270,5 @@ that is moved to node1).
This illustrates the second principle of the layout computation: **if there is
a choice in moving data out of some nodes, then all links between pairs of
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 algorithm to achieve this so there might be some small
fluctuations, as we see above).