This chapter mentioned that we can partition a long queue using consistent hashing or a key-value store. After partitioning, how do we know which partition/host holds the oldest message (the message that should be retrieved at the next message retrieve request)?
Course: Grokking Modern System Design Interview for Engineers & Managers - Learn Interactively
Lesson: Design of a Distributed Messaging Queue: Part 1 - Grokking Modern System Design Interview for Engineers & Managers