News for hackers. Stuff that matters.
Re:An illustrated proof of the CAP theorem (2018) by shepherdjerred on Tuesday October 08, 2024 @12:34AM (#41773867)
It's impossible to distinguish between high latency and unavailability. You can model unavailability as infinite latency.

In a real system you can wait for a partition event to resolve itself before replying which preserves consistency at the cost of latency (availability).

Re:An illustrated proof of the CAP theorem (2018) by nextaccountic on Tuesday October 08, 2024 @12:43AM (#41773907)
> In a real system you can wait for a partition event to resolve itself before replying which preserves consistency at the cost of latency (availability).

This is true, but PACELC states that even if there is no partition you still have a consistency vs latency tradeoff (because the processes that guarantee consistency eat up latency in form of network roundtrips)

Re:An illustrated proof of the CAP theorem (2018) by shepherdjerred on Tuesday October 08, 2024 @12:46AM (#41773928)
100%, I don't think what we're saying conflicts. There is _always_ a tradeoff between consistency and availability whether you're thinking of PAC or PACELC. PACELC just makes it explicit that this tradeoff exists whether you're partitioned or not.