|
|
|
google unix.com
|
|||||||
| Forums | Register | Forum Rules | Links | Albums | FAQ | Members List | Calendar | Search | Today's Posts | Mark Forums Read |
| High Level Programming Post questions about C, C++, Java, SQL, and other programming languages here. |
More UNIX and Linux Forum Topics You Might Find Helpful
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Quad-Ren 0.3 (Default branch) | iBot | Software Releases - RSS News | 0 | 03-02-2009 06:30 AM |
| Quad-Ren 0.2 (Default branch) | iBot | Software Releases - RSS News | 0 | 02-18-2009 03:30 AM |
| Quad Ethernet | hshapiro | SUN Solaris | 5 | 09-25-2007 10:10 PM |
| Quad or Duel Processors | rfmurphy_6 | Windows & DOS: Issues & Discussions | 4 | 10-05-2005 09:13 AM |
| Quad Booting... | jboswell | BSD | 1 | 03-02-2005 07:26 PM |
Powered by 
|
|
|
LinkBack | Thread Tools | Search this Thread | Rate Thread | Display Modes |
10-02-2009
|
||||
|
||||
|
C POSIX: Analyze a Boggle board using 100% CPU on a quad core.
I have written the worlds most advanced lexicon data structure in order to score a Boggle Board using a parallel algorithm.
I ran into a problem. Using mutexes and condition variables did not allow me to use 100% of the CPU resources on my quad core Q9450. I wonder if the problem is that the worker threads call the same recursive function many thousands, to millions of times per second. Should each thread have its own identical recursive function defined so that they are not all waiting to access the memory where the function is stored? Thank You, HeavyJ |
| Bookmarks |
| Tags |
| optimize, parallel, posix, thread |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
Threaded Mode
