Skip to main content
Stack Overflow
  1. About
  2. For Teams
Filter by
Sorted by
Tagged with
-3 votes
0 answers
15 views

I was reading into Raft consensus algorithm where the client requests are served by the leader node. In case a new election term begins, there is a brief period when the leader is not elected. We also ...
0 votes
0 answers
73 views

I am using FlowSOM() Clustering from the FlowSOM and am getting an error while a vectorized function is running: Error in map2(): i In index: 8. i With name: FileID8. Caused by error in map() at ...
4 votes
1 answer
86 views

We know that a swap object consists of a shared register and supports a swap operation between the shared register and any local register, which atomically exchanges the values of the two registers. A ...
0 votes
1 answer
217 views

Request: to run Prysm client with checkpoint sync using --checkpoint-block value (block number) and --checkpoint-state value (state root), does it require to have this block already synced in the ...
0 votes
0 answers
46 views

In Lamport's Distributed Mutual Exclusion algorithm, a process can enter the critical section if two conditions are met: Its request is at the head of its own queue. It has received a reply from all ...
0 votes
1 answer
39 views

Lets say We have a cluster of 5 nodes and A is the leader. Following sequence of events take place: A sends the replicate change request in parallel to all the followers. Only B could receive the ...
-1 votes
1 answer
187 views

Referring to this table depicted in the Raft paper, I did not find where do followers memorize the leader in any form such as identifier, physical addr, etc. Instead, I only find the leader ID in ...
0 votes
0 answers
36 views

I have 3 aligned sequences and a consensus sequences: aln_seqs <- c('CCCGNGGGAGANAGACTGAGTCTGTGATATACACATCAGAATCCTTACTTTGTGACACATTTGTTTGAGA','CCCGGGGGAGAAAGNTTT-...
-3 votes
1 answer
105 views

As per DDIA (Design data intensive application) to make writes atomic in distributed databases we can use read repair which means lets say if client made read request to 3/5 replica nodes and on two ...
3 votes
2 answers
374 views

I am reading DDIA. It says "possible to make Dynamo-style quorums linearizable at the cost of reduced performance: a reader must perform read repair (see "Read repair and antientropy" on page 178)...
0 votes
1 answer
270 views

Raft consensus protocol requires nodes to have a replicated log, and all the implementations that I'm aware of require that every node has a durable local storage to keep the log. In cloud-native ...
0 votes
0 answers
181 views

I am using the RAFT consensus theorem through the Apache Ratis library. In my use case, lets say for a particular command my application performs multiple actions (logical calculation, updating new ...
0 votes
1 answer
832 views

I've been researching Raft Consensus Algorithm for a problem that I'm trying to solve, and I've decided that Raft is indeed the way to go. However, due to the nature of the environment I'm working on, ...
0 votes
1 answer
258 views

I am just wondering and struggling to understand how blockchain developers of crypto coins like BTC, ETH, etc. manage to update the code due to the consensus nature. Do they stop all nodes, so later ...
1 vote
1 answer
214 views

I am trying to understand why ZAB is required when Paxos does the same thing. I read multiple documentations and articles and all summed up that Zookeeper requires the instructions to be in the exact ...

15 30 50 per page
1
2 3 4 5
...
21

AltStyle によって変換されたページ (->オリジナル) /