Return-Path: X-Original-To: apmail-felix-dev-archive@www.apache.org Delivered-To: apmail-felix-dev-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id DE72B17783 for ; Fri, 26 Jun 2015 12:32:04 +0000 (UTC) Received: (qmail 45250 invoked by uid 500); 26 Jun 2015 12:32:04 -0000 Delivered-To: apmail-felix-dev-archive@felix.apache.org Received: (qmail 45176 invoked by uid 500); 26 Jun 2015 12:32:04 -0000 Mailing-List: contact dev-help@felix.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: dev@felix.apache.org Delivered-To: mailing list dev@felix.apache.org Received: (qmail 45165 invoked by uid 99); 26 Jun 2015 12:32:04 -0000 Received: from arcas.apache.org (HELO arcas.apache.org) (140.211.11.28) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 26 Jun 2015 12:32:04 +0000 Date: Fri, 26 Jun 2015 12:32:04 +0000 (UTC) From: "Guillaume Nodet (JIRA)" To: dev@felix.apache.org Message-ID: In-Reply-To: References: Subject: [jira] [Assigned] (FELIX-4926) Investigate rewriting the resolver algorithm to use loops instead of recursion MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 7bit X-JIRA-FingerPrint: 30527f35849b9dde25b450d4833f0394 [ https://issues.apache.org/jira/browse/FELIX-4926?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Guillaume Nodet reassigned FELIX-4926: -------------------------------------- Assignee: Guillaume Nodet > 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 > > 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)