News for hackers. Stuff that matters.

A comment on How to Design a Scalable Rate Limiting Algorithm.

Re:How to Design a Scalable Rate Limiting Algorithm by RealNeatoDude on Tuesday December 19, 2017 @02:16PM (#15963148)
Excellent article! One question though:

> A better approach is to use a “set-then-get” mindset, relying on atomic operators that implement locks in a very performant fashion, allowing you to quickly increment and check counter values without letting the atomic operations get in the way.

Can you elaborate on this? Why is it more performant? And what are the trade-offs vs. get-then-set?

[ Parent | on HN ]
Re:How to Design a Scalable Rate Limiting Algorithm by graphememes on Tuesday December 19, 2017 @02:56PM (#15963622)
Was passing by and saw this, a better explanation and in-depth analysis can be found here:

> https://blog.figma.com/an-alternative-approach-to-rate-limit...

[ Parent | on HN ]