mridulm opened a new pull request, #3487: URL: https://github.com/apache/celeborn/pull/3487
### What changes were proposed in this pull request? Speedup `finishMapperAttempt` by making its complexity constant instead of linear to number of mappers ### Why are the changes needed? As detailed in [CELEBORN-2160](https://issues.apache.org/jira/browse/CELEBORN-2160), when there are a large number of concurrent 'mapper' tasks for a stage with a large mapper partitions - the linear (to number of mappers) complexity of `finishMapperAttempt` results in rpc timing out and failing. ### Does this PR introduce _any_ user-facing change? No ### How was this patch tested? Existing tests. -- 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]
