zuston commented on code in PR #2729:
URL: https://github.com/apache/uniffle/pull/2729#discussion_r2796665158
##########
client-spark/common/src/main/java/org/apache/spark/shuffle/handle/MutableShuffleHandleInfo.java:
##########
@@ -259,6 +259,15 @@ public Map<Integer, List<ShuffleServerInfo>>
getAvailablePartitionServersForWrit
// 0, 1, 2
int idx = (int) (taskAttemptId % (serverSize - 1)) + 1;
candidate = servers.get(idx);
+ } else {
Review Comment:
This change targets the second-split scenario where all load-balanced
servers have already been split.
In this case, we should fall back to selecting a server using the hash-based
algorithm.
At the current stage, this approach is sufficient for large-scale partition
workloads. Introducing additional mechanisms would add unnecessary complexity
without clear benefit.
--
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.
To unsubscribe, e-mail: [email protected]
For queries about this service, please contact Infrastructure at:
[email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
