| Thread Tools | Search this thread |
|---|
Tony_the_D
| October 10, 2008 9:48 AM PDT Multi-core example with OpenMP slower than single core? | ||||
I am testing use of OpenMP to make use of multi-core processors. An example to compute e and pi found on the web works and runs faster than the single core equivalent. But the code snippet below (from a routine to do matrix inversion) appears to work and shows 100% cpu usage on dual processors, but in fact takes longer to run than the single core processing equivalent.
!$omp parallel sections shared(a,f) Question: Has anyone else experienced cases where the dual core processing runs slower than the single core equivalent? Any ideas why this is so? I also tried using OpenMP to speed up a Quicksort algorithm and got the same result (single core is faster than dual core?)
| |||||
|
|||||||||||||
|
|||||||||||||
|
|||||||||||||
|
|||||||||||||
| 6668 users have contributed to 28284 threads and 87461 posts to date. |
|---|
| In the past 24 hours, we have 6 new thread(s) 35 new posts(s), and 50 new user(s). In the past 3 days, the most popular thread for everyone has been Fortran and Matlab The most posts were made to Larger Test Data The post with the most views is Quoting - nabeels Hello e Please welcome our newest member karolbe |