Re^2: Is this a job for a fork?

in reply to Re: Is this a job for a fork?
in thread Is this a job for a fork?

The idea is to partition the input file into n partitions for n processes,

Perhaps you can explain how this schema will allow "I'm looking for pairs ie A1:A2, B1:B2 etc. Each member of the pair can exist anywhere in the file. "?

Comment on Re^2: Is this a job for a fork?

Replies are listed 'Best First'.
Re^3: Is this a job for a fork? by thomas11 (Novice) on Jul 13, 2010 at 09:32 UTC
Yeah, I guess it doesn't. Don't know what I was thinking there. Damn, this was my first post on perlmonks :-( The partitioning solution would only work if you already had a list of potential pairs, which you could then check in parallel chunks.	[reply]

In Section Seekers of Perl Wisdom