Portability | portable |
---|---|
Stability | experimental |
Maintainer | Sebastian Fischer (sebf@informatik.uni-kiel.de) |
This Haskell library provides an implementation of parallel search based on the search tree provided by the package tree-monad.
- parallelTreeSearch :: Int -> Int -> SearchTree a -> IO [a]
Documentation
:: Int | thread limit |
-> Int | work limit |
-> SearchTree a | search space represented as tree |
-> IO [a] |
This function enumerates the results stored in a SearchTree
in
parallel. It is parameterised by the maximum number of threads to
use and the maximum amount of work to perform by each thread before
communicating the results.