From 2f813105819ea18cb078aaf22252a144fe6ce348 Mon Sep 17 00:00:00 2001 From: Chris Lu Date: Thu, 6 Jun 2019 01:50:44 -0700 Subject: [PATCH] Updated Erasure coding for warm storage (markdown) --- Erasure-coding-for-warm-storage.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Erasure-coding-for-warm-storage.md b/Erasure-coding-for-warm-storage.md index 1e40fe0..9271177 100644 --- a/Erasure-coding-for-warm-storage.md +++ b/Erasure-coding-for-warm-storage.md @@ -38,7 +38,7 @@ For example, one read request for 3,0144448888 will: 2. The read client can randomly pick one of the returned volume servers, A. 3. Server A will read its index file, find the right volume server B that has the file content. Sometimes it may have to contact additional servers if the file is split between multiple blocks. But usually the data shard has 1GB block size. So this does not happen often. -So in normal operations, there are usually one extra network hop compared to normal volume reads. +In normal operations, there are usually one extra network hop compared to normal volume reads. In case of missing data shards or read failures from server B, server A will try to collect as many pieces of data as possible from the remaining servers, and compute the required data.