Yes and I've been re-reading that page for weeks :-)
What an unusual and interesting task. What's the context? And string is huge enough for parallelization overhead to pay off?
I'm doing with words what mathematicians do with numbers. It's very similar to searching for prime numbers. These liguistic primes are defined by rules of grammar. So my data is not huge strings but huge sets of billions, and trillions, and hundreds of trillions of uniform sized strings. You nailed what I have to do by suggesting chunking the data to equal sizes guaranteed not to increment. Perfect for MCE! Thank you.
This one liner prints all my data, one string at a time:
I'll post a root node with more detail once I get it ported over to MCE.perl -e '$a="a";$n=1;$s=time;print"SEC\tWORD\tITER\n";while(){print"\r +",time-$s,"\t$a\t$n ";$a++&&$n++}'
In reply to Re^4: Getting started with MCE (the Many-Core Engine)
by Anonymous Monk
in thread Getting started with MCE (the Many-Core Engine)
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |