Comment on A simple distributed algorithm for small idempotent informationparentComments−bkirwi12yHmm -- if a process bumps its `currentEpoch` for every proposal, and the delays are randomized, it looks like this would fail only probabilistically and may eventually succeed. I'll have to take a closer look later today...−antirez12yExactly that. It works only as long as the retry time is randomized and much larger than then network RTT.
Comments
Hmm -- if a process bumps its `currentEpoch` for every proposal, and the delays are randomized, it looks like this would fail only probabilistically and may eventually succeed. I'll have to take a closer look later today...
Exactly that. It works only as long as the retry time is randomized and much larger than then network RTT.