mirror of
https://github.com/kvcache-ai/Mooncake.git
synced 2026-11-05 01:17:55 +00:00
[GH-ISSUE #749] [Paper Question] this cache-aware prefill scheduling strategy is a little bit confused me #235
Labels
No labels
ascend
auto-closed
bug
bug
CI/Build
Common
documentation
enhancement
feature request
good first issue
help wanted
high priority
MetaX
nightly-failure
pull-request
PyTorch Backend
question
RFC
Roadmap
stale
Store
Tests
Transfer Engine
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set.
Reference
kvcache-ai/Mooncake#235
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Originally created by @Huixxi on GitHub (Aug 15, 2025).
Original GitHub issue: https://github.com/kvcache-ai/Mooncake/issues/749
Originally assigned to: @chestnut-Q on GitHub.
Here, what if the time of prefill calculate this transfer_len prompt T_prefill_transfer_len on this current instance is shorter than the time T_transfer transfer this part of kvcache from the best_match_instance? Should there need compare these two time cost first then do the following TTFT comparison?
@Huixxi commented on GitHub (Aug 15, 2025):
And it seems the selection of P doesn't consider the load of P, it that ok?
@chestnut-Q commented on GitHub (Aug 17, 2025):
Hi @Huixxi. We don’t directly compare the transfer time (T_transfer) and the prefill time (T_prefill_transfer_len). Instead, we use the parameter kvcache_balancing_threshold to decide whether to transfer the KVCache. In long-context requests, where this algorithm is intended to be applied, transfer time is almost always lower than recomputation, so once best_prefix_len / prefix_len exceeds kvcache_balancing_threshold, we no longer consider recomputation.
Regarding the load on prefill instances, there is indeed an implicit consideration: we treat the sum of queued prefill execution times on an instance (T_queue) as its load.