Return-Path: X-Original-To: apmail-incubator-lucy-user-archive@www.apache.org Delivered-To: apmail-incubator-lucy-user-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id 846717695 for ; Wed, 9 Nov 2011 18:41:51 +0000 (UTC) Received: (qmail 99442 invoked by uid 500); 9 Nov 2011 18:41:51 -0000 Delivered-To: apmail-incubator-lucy-user-archive@incubator.apache.org Received: (qmail 99361 invoked by uid 500); 9 Nov 2011 18:41:51 -0000 Mailing-List: contact lucy-user-help@incubator.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: lucy-user@incubator.apache.org Delivered-To: mailing list lucy-user@incubator.apache.org Received: (qmail 99353 invoked by uid 99); 9 Nov 2011 18:41:51 -0000 Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136) by apache.org (qpsmtpd/0.29) with ESMTP; Wed, 09 Nov 2011 18:41:51 +0000 X-ASF-Spam-Status: No, hits=-0.0 required=5.0 tests=SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (athena.apache.org: local policy) Received: from [68.116.39.62] (HELO rectangular.com) (68.116.39.62) by apache.org (qpsmtpd/0.29) with ESMTP; Wed, 09 Nov 2011 18:41:45 +0000 Received: from marvin by rectangular.com with local (Exim 4.69) (envelope-from ) id 1ROD5t-0002JP-Fo for lucy-user@incubator.apache.org; Wed, 09 Nov 2011 10:41:53 -0800 Date: Wed, 9 Nov 2011 10:41:53 -0800 From: Marvin Humphrey To: lucy-user@incubator.apache.org Message-ID: <20111109184153.GA8863@rectangular.com> References: MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: User-Agent: Mutt/1.5.18 (2008-05-17) Subject: Re: [lucy-user] LucyX::Remote::SearchServer concurrency On Wed, Nov 09, 2011 at 08:33:31PM +0200, goran kent wrote: > Looking at the code (and I'm no Perl guru) for > LucyX::Remote::SearchServer->serve(), I don't see any forking or other > multitasking mechanisms being used. Correct me if I'm miss-reading > the code, but doesn't that mean that serve() will block until it > finishes the current search -- ie, no concurrent searches? Yes. FWIW, Searchers are cheap, because we rely heavily on the OS cache rather than dump stuff into process RAM. That aids with multi-process concurrency, because adding another worker is inexpensive. Marvin Humphrey