From 283e18cf5f9bb94faa9e61c58cba82240f58ded2 Mon Sep 17 00:00:00 2001 From: Ravind Kumar Date: Fri, 12 May 2023 12:51:08 -0400 Subject: [PATCH] Minor typo cleanups --- .../availability/availability-erasure-sharding-split-brain.svg | 2 +- source/operations/concepts/availability-and-resiliency.rst | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/source/images/availability/availability-erasure-sharding-split-brain.svg b/source/images/availability/availability-erasure-sharding-split-brain.svg index 1a6616d1..24c58a43 100644 --- a/source/images/availability/availability-erasure-sharding-split-brain.svg +++ b/source/images/availability/availability-erasure-sharding-split-brain.svg @@ -1 +1 @@ - \ No newline at end of file + \ No newline at end of file diff --git a/source/operations/concepts/availability-and-resiliency.rst b/source/operations/concepts/availability-and-resiliency.rst index 92d8329e..a29e8284 100644 --- a/source/operations/concepts/availability-and-resiliency.rst +++ b/source/operations/concepts/availability-and-resiliency.rst @@ -33,7 +33,7 @@ MinIO implements :ref:`erasure coding ` as the core compon :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. - Assuming default :ref:`parity ` of ``EC:4``, MinIO shards the object into 4 (four) parity shards and 12 (twelve) data shards. + Assuming default :ref:`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 uses a deterministic algorithm to select the erasure set for a given object.