[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Axiom-developer] parallel algorithms
From: |
M. Edward (Ed) Borasky |
Subject: |
Re: [Axiom-developer] parallel algorithms |
Date: |
Sat, 14 Oct 2006 20:27:41 -0700 |
User-agent: |
Thunderbird 1.5.0.7 (X11/20060917) |
root wrote:
> Yet another parallel use would be creating direction field
> images for differential equations. Each machine could be
> given a particular isocline to compute over a given domain
> and the final combined results into solution curves.
>
>> Oh, and I forgot to mention another significant advantage.
>>
>> The "master" task knows about the "worker" machine abilities.
>> Thus it would be possible to use Magnus routines in Axiom
>> or Axiom routines in Magnus without combining the code.
>> Axiom could MapReduce a group operation, the master could
>> split it among Magnus machines (and even request different
>> Magnus procedures since they are not guaranteed to terminate),
>> "map" collect the successful results, poison the remaining Magnus
>> processes, "reduce" combine the answer, and return.
I know what Axiom is, I know what MapReduce is, but what is Magnus? This
is a name I've not heard before.