Re:An illustrated proof of the CAP theorem (2018)
by shepherdjerred on Tuesday October 08, 2024 @09:43AM
(#41777294)
> If your refuse requests during a partition, you conserve Consistency, and you lose Availability. If you keep accepting requests during a partition, it's the opposite.
I agree
> High latency is considered a partition in CAP.
Can you support this claim? I don't think this is true unless you're specifically talking about high latency between nodes rather than latency between the sender and the system.
Re:An illustrated proof of the CAP theorem (2018)
by tux3 on Tuesday October 08, 2024 @10:49AM
(#41777959)
>high latency between nodes rather than latency between the sender and the system
Yes, that's what I meant. To clarify, latency between the sender and the system would still not be an availability issue, but it also wouldn't be a partition. It's just out of scope of the CAP theorem. The user might be on a bad mobile connection, but it doesn't impact the distributed system itself.
Re:An illustrated proof of the CAP theorem (2018)
by bearbearfoxsq on Tuesday October 08, 2024 @04:16PM
(#41781410)
I think the CAP 12 Years Later [1] paper covers this aspect of what latency means versus a partition. It describes that at some point in time a designer has to decide whether nodes have waited long enough and should return a response (A) or that they should wait until (potentially forever) before a response (C)
Availability in CAP is purely a software decision, it's an algorithmic property. Roughly speaking, it is the decision to continue accepting requests during a partition, possibly sacrificing Consistency. If your refuse requests during a partition, you conserve Consistency, and you lose Availability. If you keep accepting requests during a partition, it's the opposite.
High latency is considered a partition in CAP. Any hardware error, any network trouble, any bug, crash, any unreachable machines is never an Availability issue.