Modelling API rate limits as diophantine inequalities
10 months ago
- #diophantine-equations
- #rate-limiting
- #optimization
- Understand the rate limit constraint of 10 requests per hour.
- Tasks have a retry pattern at minutes 0, 10, and 30 after start.
- Mathematically model the problem using Diophantine inequalities.
- Use integer linear programming to ensure no 60-minute window exceeds the rate limit.
- Implement a Go program to check if scheduling a new task violates constraints.
- Optimize the solution using a sliding window technique for efficiency.
- Highlight the intersection of software problems and mathematical solutions.