Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bkirwi
on Feb 21, 2014
|
parent
|
context
|
favorite
| on:
A simple distributed algorithm for small idempoten...
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...
antirez
on Feb 21, 2014
[–]
Exactly that. It works only as long as the retry time is randomized and much larger than then network RTT.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
