0

If a system is partition tolerant, it's impossible for it to be consistent since there's no way for one node to update another. How can you be both consistent while partition intolerant be possible?

Improve this question
4
  • Re: "there's no way for one node to update another": If the system is unavailable (doesn't support A during a P), then why would one node need to update another? Commented Jun 27, 2024 at 22:28
  • @ruakh Are you saying that not available implies consistency? It doesn't matter if it's available or not, the data still need to be consistent Commented Jun 27, 2024 at 23:18
  • It's not that "not available" implies consistency, but that it allows consistency. If the system is consistent until the network partition, and doesn't allow writes during the network partition, then it can remain consistent until it starts allowing writes again. Commented Jun 27, 2024 at 23:26
  • @ruakh I see makes sense thanks Commented Jun 27, 2024 at 23:31
Related questions
34
How CA distributed system according to Cap Theorem can exist
1
Distributed Erlang and the CAP theorem
0
Using CAP Theorem in customer negotiations
Load 4 more related questions Show fewer related questions

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.