Hello;<br><br> I have a piece of code in which I employ the `par` construct to add some implicit parallelism<br>to a theorem prover. However, when running the *same* code with <br><br>+RTS -N1<br>+RTS -N5<br>+RTS -N10<br><br>
I see a huge slowdown (a factor of 50 with 5 processes and a factor of 100 for 10 on an 8-core machine).<br><br>Very little time is being spent using the garbage collector. Any suggestions?<br><br>Thanks,<br>-Jamie<br>