The program spawns n + 2 threads. sieve and counter are only spawned
once, but filter is spawned for every prime number.
With Roger's command line, primes took me about 91 seconds - possibly
because it isn't looking for a specific end. primes 1 2837711 takes 43
seconds.
Up next: what happens when you share libcontrol across threads. This
is where the graphical fun begins.
On Jun 6, 2008, at 10:00 AM, [EMAIL PROTECTED] wrote:
Hello Pietro,
how many treads are created when you call
sieve n ?
Note that due to primes' syntax I can't time that until I know what
the 205,963rd prime number is.
2837711
best regards
Roland
