Li Wang
Li Wang
@PFZheng
It seems to be the simplest way for braft to enable application guarantee linearable reads. The caller at server side could either wait a while to retry or return EAGAIN...
Linearizability requires that each read must return the result of the latest committed write right before the read is initiated. In theory, each write could be acked to client when...
@PFZheng
The current implementation seems to be the simplest way with minimum modification to braft to support two data copies, and it covers most situations. The only situation is when leader...
@PFZheng
@PFZheng
@chenzhangyi As the codes as well as comments in Lines 86-88 ballot_box.cpp, the elements before last_committed_index are removed. So it just needs to find the largest last_committed_index, use reverse search...