nosewings opened a new pull request, #2752: URL: https://github.com/apache/accumulo/pull/2752
Attempt to fix #2696. This replaces the complicated mutation retry logic in `Gatherer` with a more structured/algebraic approach. This new approach is recursive. Making the recursive call asynchronously should prevent a stack overflow (it does in the tests that I've run), since the task is submitted to the common ForkJoinPool rather than being called directly. This probably imposes a performance penalty, but I don't know how that compares to the cost of the I/O in this codepath. -- 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]
