If you have n processors, start with the n possible ways to select from log2 n items. Assign each processor to find a solution based on the resulting subset of remaining items. Each processor should be able to work fairly independently, and when they are done, they can compare results and find the best one. Don
On Mar 27, 10:47 pm, Arun Vishwanathan <[email protected]> wrote: > Hi all, > > I am planning to implement a parallel version of the 0-1 knapsack problem. > I tried reading up a bit and there are few suggestions here and there. > However I would like to know if anyone has an idea or links that I cud > refer for this? The main problem in parallelizing a DP algorithm is the > dependencies due to recursion? Is there an effective strategy for this?? > Using shared memory or message passing approach? > > Arun -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
