Repository navigation
Conversation
Contributor
Author
|
@coderabbitai full review Please review exact head 45794f6. This draft has completed focused CPU validation and independent progress-bound review; real-server GPU evidence is still pending. |
✅ Action performedFull review finished. |
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
An admitted expensive item can wait indefinitely when cheaper items keep arriving: each batch re-sorts the backlog and takes its cheapest prefix. The pinned GLiClass L4 comparison reproduced 300-second timeouts with both the current profile and PR656’s adaptive-batching workaround, while cheap requests continued completing. Full negative comparison.
After an ordinary batch bypasses the oldest batchable item, reserve that exact entry for the next batchable turn. The reserved turn takes its cost-sorted suffix without wrapping into cheaper arrivals; ordinary packing then resumes. An entry with k older batchable entries gets a dispatch opportunity within 2(k + 1) nonempty batchable turns. Existing isolated-item turns can interleave, and this is a dispatch-count bound rather than a wall-clock latency guarantee.
The change preserves request/cost caps, the oversized-singleton escape, isolated-item ordering, and ordinary homogeneous/fitting batch membership. Arrival identity is internal. The worker change only corrects documentation about draining a snapshot count; its executable AST is unchanged. No model profile, adaptive controller, or idle-worker scheduling change is included.
Validation completed:
The planned SIE server + SIEClient L4 comparison of identical-profile baseline/candidate sources is complete and failed the original numerical criterion. This PR remains draft and unmerged, with no qualified default-behavior change or GPU performance claim; investigation continues. All original criteria and failed evidence remain unchanged.
Refs #390.
Summary by CodeRabbit