- 11 Aug, 2014 1 commit
-
-
Bastian Holst authored
Remove parallel strategies that have not proven useful. API cleanup
-
- 06 Aug, 2014 1 commit
-
-
Bastian Holst authored
-
- 10 May, 2014 1 commit
-
-
Bastian Holst authored
-
- 07 May, 2014 2 commits
-
-
Bastian Holst authored
-
Bastian Holst authored
Fair search strategies are now implemented so that they return lazy lists instead of the old monadic lists.
-
- 16 Apr, 2014 3 commits
-
-
Bastian Holst authored
-
Bastian Holst authored
-
Bastian Holst authored
-
- 11 Apr, 2014 2 commits
-
-
Bastian Holst authored
-
Bastian Holst authored
-
- 09 Apr, 2014 1 commit
-
-
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.
-
- 02 Apr, 2014 1 commit
-
-
Bastian Holst authored
-
- 01 Apr, 2014 1 commit
-
-
Bastian Holst authored
Add bag strategies which do not use STM.
-
- 31 Mar, 2014 1 commit
-
-
Bastian Holst authored
-
- 26 Mar, 2014 2 commits
-
-
Bastian Holst authored
Implement a breadth-first strategy with gang-of-threads for use with SetFunctions. When the result of the search contains a Choice, it is not evaluated any further, but its evaluation is deferred lazily.
-
Bastian Holst authored
-
- 24 Mar, 2014 2 commits
-
-
Bastian Holst authored
This splitAll strategy uses a common parallele evaluation strategy with a parallel bfs search strategy.
-
Bastian Holst authored
-
- 12 Mar, 2014 1 commit
-
-
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.
-
- 11 Mar, 2014 1 commit
-
-
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.
-
- 07 Mar, 2014 2 commits
-
-
Bastian Holst authored
-
Bastian Holst authored
-
- 05 Mar, 2014 2 commits
-
-
Bastian Holst authored
-
Bastian Holst authored
-
- 19 Feb, 2014 1 commit
-
-
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.
-
- 11 Feb, 2014 2 commits
-
-
Bastian Holst authored
System.Cmd is deprecated now.
-
Bastian Holst authored
According to the Functor-Applicative-Monad proposal Monads now depends on Applicative and MonadPlus depends on Alternative. This commit adds instances for these for both SearchTree and UnsafeSearchTree. http://www.haskell.org/haskellwiki/Functor-Applicative-Monad_Proposal
-
- 03 Feb, 2014 1 commit
-
-
Bastian Holst authored
-
- 17 Jan, 2014 1 commit
-
-
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
-
- 16 Jan, 2014 1 commit
-
-
Bastian Holst authored
-
- 15 Jan, 2014 1 commit
-
-
Björn Peemöller authored
-
- 12 Jan, 2014 1 commit
-
-
Bastian Holst authored
-
- 06 Dec, 2013 1 commit
-
-
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.
-
- 27 Nov, 2013 1 commit
-
-
Bastian Holst authored
-
- 22 Nov, 2013 1 commit
-
-
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.
-
- 21 Nov, 2013 1 commit
-
-
Bastian Holst authored
-
- 19 Nov, 2013 2 commits
-
-
Bastian Holst authored
-
Bastian Holst authored
-
- 14 Nov, 2013 1 commit
-
-
Bastian Holst authored
-
- 13 Nov, 2013 1 commit
-
-
Bastian Holst authored
Bindings for a new search strategy.
-