minio/docs
1
0
Fork 0
mirror of https://github.com/minio/docs.git synced 2025-07-30 07:03:26 +03:00
Code Activity

Minor typo cleanups

Browse Source
This commit is contained in:
Ravind Kumar
2023-05-12 12:51:08 -04:00
parent 947b16155a
commit 283e18cf5f
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
source/images/availability/availability-erasure-sharding-split-brain.svg
View File

File diff suppressed because one or more lines are too long
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 158 KiB

After

Width:  |  Height:  |  Size: 128 KiB

2
source/operations/concepts/availability-and-resiliency.rst
View File

@ -33,7 +33,7 @@ MinIO implements :ref:`erasure coding <minio-erasure-coding>` as the core compon
:alt: Diagram of erasure coded object partitioned into twelve data shards and four parity shards :alt: Diagram of erasure coded object partitioned into twelve data shards and four parity shards
This small one-node deployment has 16 drives in one erasure set. This small one-node deployment has 16 drives in one erasure set.
Assuming default :ref:`parity <minio-ec-parity>` of ``EC:4``, MinIO shards the object into 4 (four) parity shards and 12 (twelve) data shards. Assuming default :ref:`parity <minio-ec-parity>` of ``EC:4``, MinIO partitions the object into 4 (four) parity shards and 12 (twelve) data shards.
MinIO distributes these shards evenly across each drive in the erasure set. MinIO distributes these shards evenly across each drive in the erasure set.
MinIO uses a deterministic algorithm to select the erasure set for a given object. MinIO uses a deterministic algorithm to select the erasure set for a given object.