This brings me to another question: assuming that my "similar" hash would be populated with anywhere from several hundred thousand to a milion or more key value pairs...is there a better way to tackle this? I am working on a blade server with 24 physical CPU's and more than 500gb of RAM...I must be able to determine the similarity metric (keeping only those that are a 90% or better match) of every single key to every other key. Given those resources and requirements...what are your thoughts?
In reply to Re^2: dynamic number of threads based on CPU utilization
by mabossert
in thread dynamic number of threads based on CPU utilization
by mabossert
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |