network programming - Why is the CAP theorem interesting? -
is there mathematically interesting cap theorem? looking @ the proof, there seem 4 different cases 2 different statements across 2 formalisms. cap theorem holds in 3 trivial cases , not in fourth one. of use extremely roundabout proof techniques extraordinarily simple.
3.1 thm 1. if 2 machines have no communication whatsoever, cannot contain consistent data.
3.1 corollary 1.1 if 2 machines not allowed wait receive messages each other , communication line between them arbitrarily slow, inconsistent result if write 1 , query other.
4.2 thm 2. if 2 machines allowed wait-with-timeout have no connection whatsoever, still cannot contain consistent data.
... if communication line between them has guarantees worst-case transmission time, can wait timeout each time perform write , cap theorem doesn't apply.
am missing here? proof techniques used in paper seem more kind of thing find in generals-on-a-hill problem (which nontrivial) generals can set time coordinate attack , agree they're going it, can't agree agree. can't see how applies here.
Comments
Post a Comment