wsry opened a new pull request #18631:
URL: https://github.com/apache/flink/pull/18631
## What is the purpose of the change
Currently, the data read buffers for sort-shuffle are allocated in a random
way and some result partitions may occupy too many buffers which leads to the
starvation of other result partitions. This patch improves the scenario by not
reading data for those result partitions which already occupy more than the
average number of read buffers per result partition.
## Brief change log
- Not reading data for those result partitions which already occupy more
than the average number of read buffers per result partition.
## Verifying this change
This change is already covered by existing tests.
## Does this pull request potentially affect one of the following parts:
- Dependencies (does it add or upgrade a dependency): (yes / **no**)
- The public API, i.e., is any changed class annotated with
`@Public(Evolving)`: (yes / **no**)
- The serializers: (yes / **no** / don't know)
- The runtime per-record code paths (performance sensitive): (yes / **no**
/ don't know)
- Anything that affects deployment or recovery: JobManager (and its
components), Checkpointing, Kubernetes/Yarn, ZooKeeper: (yes / **no** / don't
know)
- The S3 file system connector: (yes / **no** / don't know)
## Documentation
- Does this pull request introduce a new feature? (yes / **no**)
- If yes, how is the feature documented? (**not applicable** / docs /
JavaDocs / not documented)
--
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]
