On February 1, I sent a message to this list asking for advice on how
to write a parallel term reduction system. I now have a semi-explicit
parallelised version of a term reduction system that makes effective
use of multiple CPUs. The enclosed code describes the solution, even
though its
I spent four hours investigating this problem! Thank you very much for the
excellent brainfood, and challenging Haskell's claim to be rawkin' at
parallelism. I think, though it took much experimentation, that I have
confirmed that it is :-)
On Sun, Feb 1, 2009 at 9:26 PM, John D. Ramsdell
On Mon, Feb 2, 2009 at 2:15 AM, Luke Palmer lrpal...@gmail.com wrote:
I spent four hours investigating this problem! Thank you very much for the
excellent brainfood, and challenging Haskell's claim to be rawkin' at
parallelism. I think, though it took much experimentation, that I have
On Sun, Feb 1, 2009 at 9:26 PM, John D. Ramsdell ramsde...@gmail.com
wrote:
I have a reduction system in which a rule takes a term and returns a
set of terms.
The reduction system creates a tree that originates at a starting
value called the root.
For most problems, the reduction system
Luke,
I read your solution but didn't understand how it applies to my
problem. I must not have explained the problem well enough. Let me
try again.
I have a reduction system in which a rule takes a term and returns a
set of terms. The terms can be compared for equality, but they are
not
I have a reduction system in which a rule takes a term and returns a
set of terms.
The reduction system creates a tree that originates at a starting
value called the root.
For most problems, the reduction system terminates, but a step count
limit protects
from non-termination. Rule application is
