1. 11 Aug, 2014 1 commit
  2. 06 Aug, 2014 1 commit
  3. 10 May, 2014 1 commit
  4. 07 May, 2014 2 commits
  5. 16 Apr, 2014 3 commits
  6. 11 Apr, 2014 2 commits
  7. 09 Apr, 2014 1 commit
    • Bastian Holst's avatar
      Adding asymmetric split strategies · 7266e455
      Bastian Holst authored
      Adding asymmetric strategies with the eval monad. These strategies
      continue splitting only in the right/left subtrees whereas the
      left/right subtrees are evaluated in sequence. This may
      especially good for search trees that look like this
                                 ?
                                / \
                               s   ?
                                  / \
                                 s   ?
                                    / \
                                   s   …
      where s stands for nearly equally sized search trees.
      7266e455
  8. 02 Apr, 2014 1 commit
  9. 01 Apr, 2014 1 commit
  10. 31 Mar, 2014 1 commit
  11. 26 Mar, 2014 2 commits
  12. 24 Mar, 2014 2 commits
  13. 12 Mar, 2014 1 commit
    • Bastian Holst's avatar
      Add two new fair search strategies · 12822b45
      Bastian Holst authored
      Add two new search strategies based on the initial one and therefore
      branching into two threads at each choice. Both do less
      synchronisation and are therefore more scalable.
      12822b45
  14. 11 Mar, 2014 1 commit
    • Bastian Holst's avatar
      Add fair bag strategy · 30f9ad15
      Bastian Holst authored
      Add a fair strategy base on the bag-of-tasks approach which should
      reduce the memory usage compared to the normal fair search.
      30f9ad15
  15. 07 Mar, 2014 2 commits
  16. 05 Mar, 2014 2 commits
  17. 19 Feb, 2014 1 commit
    • Bastian Holst's avatar
      Add various strategies using a bag-of-tasks · 17eafbd9
      Bastian Holst authored
      This commit adds various new strategies using a bag-of-tasks
      approach. The strategies resemble breadth-first search and
      depth-first-search and are parametrized with strategies to
      split the work-queues/stacks.
      17eafbd9
  18. 11 Feb, 2014 2 commits
  19. 03 Feb, 2014 1 commit
  20. 17 Jan, 2014 1 commit
    • Bastian Holst's avatar
      Add parallel strategies based on the Eval Monad · bb5f74d0
      Bastian Holst authored
      Now there are four strategies based on the eval monad (there was only
      one before). One strategy splits the evaluation at every choice
      (splitAll). At every choice the strategy creates a new spark, which
      can be evaluated in parallel. The other strategies are used to reduce
      the number of sparks that are created:
      - splitLimitDepth n splits the evaluation for a depth of n
      - splitAlternating n splits at every n-th choice
      - splitPower splits at every node with a distance of 2^i from the root
      bb5f74d0
  21. 16 Jan, 2014 1 commit
  22. 15 Jan, 2014 1 commit
  23. 12 Jan, 2014 1 commit
  24. 06 Dec, 2013 1 commit
    • Bastian Holst's avatar
      Add parallel strategy conSearch · 19095375
      Bastian Holst authored
      The parallel search strategy conSearch is very similar to the
      fairSearch but it is not fair as it limits the maximum number of
      threads to be used.
      19095375
  25. 27 Nov, 2013 1 commit
  26. 22 Nov, 2013 1 commit
    • Bastian Holst's avatar
      Add new getOneValue implementation · 8e04af71
      Bastian Holst authored
      The new parallel getOneValue implementation does not evaluate the whole
      monadic list anymore, but stoppes after the first element instead. This
      makes it possible for strategies to stop remaining running evaluations.
      8e04af71
  27. 21 Nov, 2013 1 commit
  28. 19 Nov, 2013 2 commits
  29. 14 Nov, 2013 1 commit
  30. 13 Nov, 2013 1 commit