Notes on Distributed Systems for Young Bloods – Something Similar

consistent hashing is a very commonly used technique.

Fixing a defect has a substantial (20 to 50 percent) chance of introducing another.

Lehman and Belady offer evidence that quanta should be very large and widely spaced or else very small and frequent.[14] The latter strategy is more subject to instability, according to their model. My experience confirms it: I would never risk that strategy in practice.

Strong consistency. Any read on a data item returns value corresponding to result of the most recent write on that data item (regardless of where the write occurred). A client will never see out-of-date data. Weak consistency. Every replica will see every update, but possibly in different orders. Eventual consistency. Given enough time, all updates