Let's think about that cache again: when that one node is down, overloaded, busy being deployed, etc that object is not available. This property can make operating high hit-rate caches and storage systems particularly difficult: any kind of deployment or change can look to clients like a kind of rolling outage. However, with erasure coding, single failures (or indeed any M−k number of failures) have no availability impact.
Erasure Coding versus Tail Latency
from marcbrooker@gmail.com (Marc Brooker)
Filed under:
Same Source
Related Notes
- In Eliyahu M. Goldratt's "Theory of Constraints", you...from ycombinator.com
- Nathan's four Laws of Software: 1. **Software is a gas** ...from Jeff Atwood
- > Software with fewer concepts composes, scales, and evolves mor...from oilshell
- few days ago I did something that I never thought I’d do again, and...from brandur.org
- Elisa Baniassad and Alexander Summers have this great paper [Refram...from Hillel Wayne
- Amdahl's law is often used in [parallel computing](https://en.w...from en.wikipedia.org
- But the thing about state-sponsored attacks is that they’re a bit l...from Matt Webb
- The **Therac-25** was a computer-controlled [radiation therapy](htt...from wikipedia.org