-
Notifications
You must be signed in to change notification settings - Fork 500
Refactor to use single loop for least request pod selection #1431
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
Conversation
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.
Summary of Changes
Hello @jiangxiaobin96, 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!
I've refactored the code responsible for selecting the minimum value in the least_request algorithm. The primary goal was to unify the logic that was previously duplicated across similar functions and, more importantly, to eliminate a redundant loop, making the code more efficient.
Highlights
- Code Unification & Optimization: I've optimized the selectTargetPodWithLeastRequestCount function in pkg/plugins/gateway/algorithms/least_request.go by consolidating two separate loops into a single, more efficient iteration. This change streamlines the process of identifying pods with the minimum request count.
Using Gemini Code Assist
The 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 in your pull request via creating an issue comment (i.e. comment on the pull request page) using either /gemini <command> or @gemini-code-assist <command>. Below is a summary of the supported commands.
| Feature | Command | Description |
|---|---|---|
| Code Review | /gemini review |
Performs a code review for the current pull request in its current state. |
| Pull Request Summary | /gemini summary |
Provides a summary of the current pull request in its current state. |
| Comment | @gemini-code-assist | Responds in comments when explicitly tagged, both in issue comments and review comments. |
| Help | /gemini help |
Displays a list of available commands. |
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 .gemini/ folder in the base of the repository. Detailed instructions can be found here.
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 or fill out our survey to provide feedback.
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
-
Review the Privacy Notices, Generative AI Prohibited Use Policy, Terms of Service, and learn how to configure Gemini Code Assist in GitHub here. Gemini can make mistakes, so double check it and use code with caution. ↩
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
The pull request aims to unify the code for selecting the minimum value by refactoring two loops into a single one. While this is a good optimization for performance, the new implementation contains a logical flaw that will cause incorrect behavior. The condition to find the minimum value should be a strict less-than comparison, not less-than-or-equal, to correctly handle cases where multiple pods have the same minimum request count. I've provided a critical review comment with a suggested fix to address this issue.
| if totalReq <= minCount { | ||
| minCount = totalReq | ||
| } | ||
| } | ||
| for podname, totalReq := range podRequestCount { | ||
| if totalReq == minCount { | ||
| targetPods = []string{podname} | ||
| } else if totalReq == minCount { | ||
| targetPods = append(targetPods, podname) | ||
| } |
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 logic for finding the pods with the minimum request count is flawed. The condition totalReq <= minCount will cause targetPods to be reset every time a pod with the same minimum count is found, effectively only keeping the last one encountered. Additionally, the else if totalReq == minCount block is unreachable because the first condition totalReq <= minCount already covers the equality case.
To fix this, you should use a strict less-than comparison (<) to identify a new minimum, and handle the equality case to append pods with the same minimum count.
| if totalReq <= minCount { | |
| minCount = totalReq | |
| } | |
| } | |
| for podname, totalReq := range podRequestCount { | |
| if totalReq == minCount { | |
| targetPods = []string{podname} | |
| } else if totalReq == minCount { | |
| targetPods = append(targetPods, podname) | |
| } | |
| if totalReq < minCount { | |
| minCount = totalReq | |
| targetPods = []string{podname} | |
| } else if totalReq == minCount { | |
| targetPods = append(targetPods, podname) | |
| } |
be44623 to
edb77c5
Compare
|
/cc @varungup90 @Xunzhuo |
Jeffwan
left a comment
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.
seem this is not reviewed yet. the change is very straightforward and it looks good to me.
Signed-off-by: jiangxiaobin96 <[email protected]>
|
@jiangxiaobin96 thanks for the improvement and apologies for the delay in reviewing. I changed the PR title a little bit to make it more self-explainable. |
Unify code for selecting minimum value code which is the same with least_util and least_gpu_cache and avoid two for loop.