2 ms·

I ended up writing a function that would sleep and retry according to the Fibonacci sequence up to a given total elapsed time, so you could set it to a max time

I ended up writing a function that would sleep and retry according to the Fibonacci sequence up to a given total elapsed time, so you could set it to a max timeout of 60s, for example, but if the system came up in 8 seconds, you'd be waiting not much longer than that (11 seconds, technically).

wiml 3y ago
I do this too occasionally — Fibonacci is easy to implement, and it's an exponential backoff (with a lower exponent than 2, which is also easy to implement ;) )
- nmca 3y ago
  I found the following line in a codebase once, which made me laugh: ``` interval = interval*1.6 # fiboroughly ```