Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re^3: Partition in to 63 parts

by remzak (Acolyte)
on Jan 18, 2010 at 21:36 UTC ( #818050=note: print w/replies, xml ) Need Help??

in reply to Re^2: Partition in to 63 parts
in thread Need a faster way to find matches

The data isn't random... the numbers come from another algorithm. Finding the pairs is the middle step of a three step algorithm.

BrowserUK provided a great example of using threads. When I tried your approach, I used too many threads and learned how much overhead threads require. I'll try to merge his partioning approach with my code... I'm finding that after six threads, the performance degrades (on my machine).

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://818050]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (9)
As of 2016-10-21 15:32 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (289 votes). Check out past polls.