[JaxPM] computing values vs. storing as hash

[Nate Campi]

On the jacksonville-pm-list; Jax.PM'er Nate Campi <nate at campin.net> wrote -

On Wed, Jan 02, 2002 at 04:41:59PM -0500, Bill Jones wrote:
> On the jacksonville-pm-list; Jax.PM'er Bill Jones <sneex at mac.com> wrote -
> 
> > What I'm dealing with is incoming UDP traffic, so no connection queues,
> > just a receive buffer that drops packets when it gets full. I want to
> > make this a lean mean packet-accepting machine.
> >
> 
> Then why don't you off-load the processing to two scripts:
> 
> 1) One that accept and logs the UDP connection (to make sure it's 
> NOT full...)
> 
> 2) One to process the strings.
> 
> I am NOT saying that one script couldn't handle it, but maybe it is 
> trying to juggle two many conditions before losing data or dropping 
> a connection before it is completed?

I was thinking of handing off the analysis of the packets to a child,
possibly multiple children, for just that reason.
-- 
Nate Campi     http://www.campin.net    GnuPG key: 0xC17AEF79   

Remember: if brute force doesn't work, you're just not using enough.


Jax.PM Moderator's Note:
This message was posted to the Jacksonville Perl Monger's Group listserv.
The group manager can be reached at -- owner-jacksonville-pm-list at pm.org
to whom send all praises, complaints, or comments...