wsry opened a new pull request #15193:
URL: https://github.com/apache/flink/pull/15193
## What is the purpose of the change
Currently, the sort-merge shuffle implementation uses a piece of direct
memory as index entry cache for acceleration. This patch switches to heap
memory instead to reduce the consumption of direct memory which can further
reduce the possibility of OutOfMemoryError.
## Brief change log
- Use heap memory instead of direct memory as index entry cache for
sort-merge shuffle.
## Verifying this change
This change is already covered by existing tests, such as
PartitionedFileWriteReadTest, SortMergeResultPartitionTest and
BlockingShuffleITCase.
## 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/Mesos, 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.
For queries about this service, please contact Infrastructure at:
[email protected]
