[FELIX-4926] Investigate rewriting the resolver algorithm to use loops instead of recursion

• Type: New Feature
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Fix Version/s: resolver-1.6.0
• Component/s: Resolver
• Assignee: Guillaume Nodet
• Reporter: Guillaume Nodet
• Created: 12/Jun/15 15:02
• Updated: 31/Aug/15 05:15
• Resolved: 19/Aug/15 07:52

Description

The resolver algorithm for Candidates#populate currently uses a recursive algorithm.
At first glance, the number of recursion can amount to the number of resources to resolve. This limits the size of the resolution.

I'd like to investigate replacing the recursion with a loop.

This may also allow using a fork/join design to leverage multiple cores for the resolution. The fork/join could also be used for the main resolution loop.
It may make things slightly harder to keep the reproducibility of the algorithm if things are not always considered in the same order. Though there may be some way around.

Issue Links

• is superceded by: FELIX-4942 Optimise the resolver