You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@felix.apache.org by "Carsten Ziegeler (JIRA)" <ji...@apache.org> on 2015/08/31 07:15:46 UTC
[jira] [Closed] (FELIX-4926) Investigate rewriting the resolver
algorithm to use loops instead of recursion
[ https://issues.apache.org/jira/browse/FELIX-4926?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Carsten Ziegeler closed FELIX-4926.
-----------------------------------
> Investigate rewriting the resolver algorithm to use loops instead of recursion
> -------------------------------------------------------------------------------
>
> Key: FELIX-4926
> URL: https://issues.apache.org/jira/browse/FELIX-4926
> Project: Felix
> Issue Type: New Feature
> Components: Resolver
> Reporter: Guillaume Nodet
> Assignee: Guillaume Nodet
> Fix For: resolver-1.6.0
>
>
> 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.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)