|
1 |
| -=== Scale horizontally |
| 1 | +=== Scale Horizontally |
2 | 2 |
|
3 | 3 | What about scaling as the demand for our application grows?((("scaling horizontally")))((("clusters", "three-node cluster")))((("primary shards", "in three-node cluster"))) If we start a
|
4 | 4 | third node, our cluster reorganizes itself to look like
|
5 | 5 | <<cluster-three-nodes>>.
|
6 | 6 |
|
7 | 7 | [[cluster-three-nodes]]
|
8 |
| -.A three-node cluster -- shards have been reallocated to spread the load |
| 8 | +.A three-node cluster--shards have been reallocated to spread the load |
9 | 9 | image::images/elas_0204.png["A three-node cluster"]
|
10 | 10 |
|
11 | 11 | One shard each from `Node 1` and `Node 2` have moved to the new
|
12 |
| -`Node 3` and we have two shards per node, instead of three. |
| 12 | +`Node 3`, and we have two shards per node, instead of three. |
13 | 13 | This means that the hardware resources (CPU, RAM, I/O) of each node
|
14 |
| -are being shared between fewer shards, allowing each shard to perform |
| 14 | +are being shared among fewer shards, allowing each shard to perform |
15 | 15 | better.
|
16 | 16 |
|
17 | 17 | A shard is a fully fledged search engine in its own right, and is
|
18 | 18 | capable of using all of the resources of a single node. With our
|
19 |
| -total of 6 shards (3 primaries and 3 replicas) our index is capable |
20 |
| -of scaling out to a maximum of 6 nodes, with one shard on each node |
| 19 | +total of six shards (three primaries and three replicas), our index is capable |
| 20 | +of scaling out to a maximum of six nodes, with one shard on each node |
21 | 21 | and each shard having access to 100% of its node's resources.
|
22 | 22 |
|
0 commit comments