[Feat] Optimize D2F Decoding Strategy to Support CUDA Graph and More Efficient Inference #17
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.
Description
This PR refactors and optimizes the D2F (Draft-to-Fill) native inference strategy. The core enhancement involves transitioning the current decoding logic to a fixed-size FIFO buffer management system for handling D2F computation blocks.
Key Optimizations
By maintaining a constant buffer size (defaulted to 4 computation blocks), we effectively lock the decoding sequence length. This design choice yields several critical performance benefits:
Technical Highlights
TODO List
d2fstrategy engine.d2fattention metadata.d2fattention kernels to the fixed-window strategy.