In Part 3 we discussed heterogeniety and some other tuning tricks. Now it’s time for some of the rest of the story.
In Part 2 we discussed how to use p-limit to handle common errors and chains of simple parent-child requests. Today we will discuss heterogenous use cases, such as complex graphs and high-variance task costs.
In Part 1 we discussed how to use p-limit and how to avoid some common pitfalls. Today we are going to go over capacity planning, and cover one last common pitfall - retry logic.
In the previous article, I very briefly described a bunch of concepts in distributed computing, but before we get to the meat of this series, there’s an elephant in the room that I have so far ignored.