hs.zhang
hs.zhang
I use another lib(brpc) which use macro EOF, but anltr(4.8) undef it in antlr-common.h. In order to use them at the same time, I need to strictly control the order...
rt 找了很久没找到,参考echo实现自己的client时找不到method
## What type of PR is this? - [ ] bug - [ ] feature - [ ] enhancement ## What problem(s) does this PR solve? #### Issue(s) number: ####...
https://github.com/vesoft-inc/nebula-importer/blob/e7281ccc8a1af64c9769743ff937cec4f26bc0e4/pkg/client/clientpool.go#L181 In case of write failure, in order to avoid avalanche, the waiting time here is better to increase exponentially, because it is likely that the write speed is too...
I try to use ExecutorLoopController in FiberManager and use CPUThreadPoolExecutor, as shown in the following example: ```cpp #include #include #include int main() { auto executor = std::make_shared(3); auto fm =...
1. Leader 向 Follower发送快照 2. Follower安装快照期间,Leader判定RPC超时(nextIndex不变) 3. Leader在block一段时间之后,重新尝试向Follower发送快照 4. 循环往复 请问会不会出现这种情况
在BallotBox中只维护每个Peer的matchIndex(每个peer已经commit的Index)。在CommitAt中推高matchIndex,并根据matchIndex判断Majority的commitIndex最小值。 这样是否会比给每个Log维护一个Ballot有显著的Commit性能提升?
如下case: 三节点{A, B, C} ``` 1. A向BC请求投票 2. BC都成功给A投票 3. B选举超时,开始preVote 4. A当选为Leader (Term=1),之后开始向BC发送心跳 5. B向AC请求投票 6. C成给B投票 7. B当选为Leader(Term=2) ``` follower在handleRequestVoteRequest中vote成功时,并没有renew follower_lease。这种情况下follower(B)在vote成功后会立即开始新的一轮选举,导致AB两个node在很短时间内先后当选为Leader 会有这种情况发生吗?
``` void FSMCaller::do_committed(int64_t committed_index) { if (!_error.status().ok()) { return; } int64_t last_applied_index = _last_applied_index.load( butil::memory_order_relaxed); // We can tolerate the disorder of committed_index if (last_applied_index >= committed_index) { return; }...