jiajunwang commented on a change in pull request #520: Refactoring soft
constraints to simply the algorithm and fix potential issues.
URL: https://github.com/apache/helix/pull/520#discussion_r337860703
##########
File path:
helix-core/src/main/java/org/apache/helix/controller/rebalancer/waged/model/AssignableNode.java
##########
@@ -222,13 +217,21 @@ public int getAssignedReplicaCount() {
/**
* Return the most concerning capacity utilization number for evenly
partition assignment.
* The method dynamically returns the highest utilization number among all
the capacity
- * categories.
+ * categories assuming the new capacity usage is added to the node.
* For example, if the current node usage is {CPU: 0.9, MEM: 0.4, DISK:
0.6}. Then this call shall
* return 0.9.
+ * @param newUsage the proposed new additional capacity usage.
* @return The highest utilization number of the node among all the capacity
category.
*/
- public float getHighestCapacityUtilization() {
- return _highestCapacityUtilization;
+ public float getExpectedHighestUtilization(Map<String, Integer> newUsage) {
Review comment:
No, the previous one has a bug if you look into deep.
I like the name, will change it later.
----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
For queries about this service, please contact Infrastructure at:
[email protected]
With regards,
Apache Git Services
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
