2010/7/25 Daniel Kersten <[email protected]>: > I wonder is there any opportunities to run the recursive backtracking > algorithm in parallel using multiprocessing? Looking at the code, I don't > see any obvious areas to parallelise... Though, even just starting two > instances searching from either end of the search space might help?
The solution space can be certainly divided into disjunctive parts. I'm not sure how difficult would it be to make the parts equal in size (or computation time). For starters, you can divide the space by the first element. For example, you can start with [0] instead of [] and stop when it reaches [1]. There are 384 rotations and positions of the first element, so you can relatively easily divide the search among 384 workers. -- You received this message because you are subscribed to the Google Groups "Python Ireland" 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/pythonireland?hl=en.
