Can someone explain me this : I did not get this statement : "For every two chunks of data, we need one parity block, so the storage overhead is 50% (Figure 2)". But the image we have used 4 chunks to create one P1 and P2 respectively
Erasure coding can be implemented in various ways depending on the specific application and desired level of protection. Some of the commonly used algorithms are
Good morning my friend, I’ve been seeing your posts quite a lot in my short time on Substack, I wanted to say keep it up!, there very interesting.
While I’m here, I share a look at some of the obscured aspects of history, through a philosophic lens, and focusing on historic books.
Here’s one you may enjoy on Tartaria:
https://open.substack.com/pub/jordannuttall/p/tartaria-in-the-17th-century?r=4f55i2&utm_medium=ios
Can someone explain me this : I did not get this statement : "For every two chunks of data, we need one parity block, so the storage overhead is 50% (Figure 2)". But the image we have used 4 chunks to create one P1 and P2 respectively
What’s a real time example of this?
Erasure coding can be implemented in various ways depending on the specific application and desired level of protection. Some of the commonly used algorithms are
- Rabin's Information Dispersal Algorithm
- Reed-Solomon codes
RAID 5 storage configuration uses erasure coding.