Pathologically Eclectic Rubbish Lister | |
PerlMonks |
Re^2: Reliable asynchronous processingby Codon (Friar) |
on Jul 18, 2005 at 19:46 UTC ( [id://475862]=note: print w/replies, xml ) | Need Help?? |
The data that would be shared is actually "static" data structures built from DB queries that need to be accessed multiple times per child per request. Trying to communicate over IPC for this sort of look-up would not be efficient for my needs. And when I say "static", I mean this data is to be read at start-up and will not be changed by any of the children (or parent) during the life of all processes / threads. I'm just starting on the architecture for this, so prototyping and benchmarks will consume a good portion of my time over the coming weeks. This was mostly a solicitation for technology suggestions.
Ivan Heffner Sr. Software Engineer, DAS Lead WhitePages.com, Inc.
In Section
Seekers of Perl Wisdom
|
|