-
Notifications
You must be signed in to change notification settings - Fork 3.5k
Simplify schedule policy implementation #13939
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
Summary of ChangesHello @xiezhq-hermann, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed! This pull request refactors the Highlights
Using Gemini Code AssistThe full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips. Invoking Gemini You can request assistance from Gemini at any point by creating a comment using either
Customization To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a Limitations & Feedback Gemini Code Assist may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments. If you're interested in giving your feedback about your experience with Gemini Code Assist for Github and other Google products, sign up here. You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension. Footnotes
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Code Review
This pull request effectively simplifies the schedule policy implementation by refactoring token reservation logic and removing the complex add_one_req_ignore_eos method. The introduction of _decode_token_usage_estimation is a good move to centralize token usage estimation, which enhances code clarity and maintainability. The changes align well with the stated goal of making the code easier to understand and refactor in the future. I have a couple of suggestions to further improve code quality.
| self.reserved_tokens += sum( | ||
| [self._decode_token_usage_estimation(r) for r in running_batch.reqs] | ||
| ) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
For better memory efficiency, you can use a generator expression instead of a list comprehension within sum(). This avoids creating an intermediate list in memory, which is more efficient, especially if running_batch.reqs contains a large number of requests.
self.reserved_tokens += sum(self._decode_token_usage_estimation(r) for r in running_batch.reqs)| return ( | ||
| min( | ||
| (req.sampling_params.max_new_tokens - len(req.output_ids)), | ||
| max(req.sampling_params.max_new_tokens - len(req.output_ids), 0), | ||
| CLIP_MAX_NEW_TOKENS, | ||
| ) | ||
| * self.new_token_ratio | ||
| * new_token_ratio | ||
| ) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The return expression multiplies an integer with a float (new_token_ratio), resulting in a float value. However, the function's type hint is -> int. To ensure type consistency and make the truncation behavior explicit, it's better to cast the final result to an integer using int().
return int(
min(
max(req.sampling_params.max_new_tokens - len(req.output_ids), 0),
CLIP_MAX_NEW_TOKENS,
)
* new_token_ratio
)|
@hnyls2002 please help take a look and I will keep polishing this PR. |
Motivation
The current
schedule_policycontains quite a bit of legacy code that complicates the logic. This PR aims to simplify the structure and make future refactoring of the mem-cache easier.Modifications
Accuracy Tests
Benchmarking and Profiling
Checklist