LogicGrowsOnTrees

From haskell-cafe

Like many other packages on Hackage, LogicGrowsOnTrees provides an implementation of logic programming using MonadPlus;  in this sense it is nothing new.  What sets it apart is that it has been designed from the beginning to work in a distributed environment, allowing it to be parallelized over large numbers of processors with no shared memory.  The benchmarks I have run (using the N-Queens problem with 17-19 queens) showed essentially perfect speed-up all the way up to 256 cores, and the only reason why this number is not larger is because I haven’t had the opportunity to run tests on a larger cluster. 

If the benchmarks are fair, I think this is a big deal.  

I have a couple of projects on the backburner which use combinatorial search.  This is awesome.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s