You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@flink.apache.org by GitBox <gi...@apache.org> on 2018/12/11 14:17:33 UTC
[GitHub] mxm opened a new pull request #7276: [FLINK-10566] Fix exponential
planning time of large programs
mxm opened a new pull request #7276: [FLINK-10566] Fix exponential planning time of large programs
URL: https://github.com/apache/flink/pull/7276
## What is the purpose of the change
The traversal of the DAG is not efficient enough at some places which can lead
to very long plan creation times.
This introduces caching for the traversal to avoid traversing nodes multiple
times.
## Brief change log
Caching is performed at two places:
- when registering Kryo types
- when determining the maximum parallelism
## Verifying this change
This change added tests and can be verified as follows:
Run `LargePlanTest` test to verify.
## Does this pull request potentially affect one of the following parts:
- Dependencies (does it add or upgrade a dependency): no
- The public API, i.e., is any changed class annotated with `@Public(Evolving)`: no
- The serializers: yes
- The runtime per-record code paths (performance sensitive): no
- Anything that affects deployment or recovery: JobManager (and its components), Checkpointing, Yarn/Mesos, ZooKeeper: no
- The S3 file system connector: no
## Documentation
- Does this pull request introduce a new feature? no
----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on GitHub and use the
URL above to go to the specific comment.
For queries about this service, please contact Infrastructure at:
users@infra.apache.org
With regards,
Apache Git Services