In edge MoE serving, at what execution granularity does single-pass victim selection maintain a strictly constant victim discovery overhead?

When a step encounters q cache misses (where q <= K), the miss handler must perform q additional linear scans to select the final eviction slots from the pre-discovered candidates.

Why do standard Least Recently Used (LRU) cache eviction policies incur high latency when evicting multiple slots?

Analyze the role of the pre-discovered candidate list in single-pass LRU victim selection during edge MoE serving. Explain how the miss handler processes runtime cache misses using this list, and explain why the condition $q \le K$ is essential to the policy's operational guarantees.