How does FOQS handle priority scheduling without slow full-table scans?
Each shard keeps an in-memory index of ready item primary keys ordered by priority. A prefetch buffer combines candidates across shards with a k-way merge, then retrieves rows from MySQL.
Answered in
How Meta Scaled FOQS, a Priority Queue Built on Sharded MySQLMeta's FOQS combines MySQL-backed persistence, per-shard ready-item indexes, prefetching, leases, and tenant capacity controls.
Read the full analysisOther questions this article answers
More system design & architecture questions
- How much spare capacity should a gateway keep?
- Why are bounded queues important for availability?
- Should a load balancer always move requests away from an unhealthy server?
- Can a circuit breaker prevent every cascading failure?
- Why does pagination improve API performance beyond just 'smaller responses'?
- Why is asynchronous logging faster than writing logs synchronously?
- When does caching actually help API performance, and when doesn't it?
- Why does payload compression trade CPU time for network time, and when is that worth it?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design & Architecture beat.