[ODE] parallel ODE

[Daniel Duhprey]

On Thu, 23 Feb 2006, Misha Smelyanskiy wrote:

-->Yes that is what I mean. Either stepping islands in parallel, or parallelizing a single island, if there are only a few islands. For CD, I mean parallelizing a given space: both broad and narrow phases.
-->  Seems like none has done it yet.

i wrote a paper for a class last year describing an algorithm parallelizing 
the LCP itself.  It was a bit of a cheat because the LCP is such a long winded 
algorithm, but it was surprisingly easy (don't tell my professor.)  I haven't 
had time to go back and look at incremental algorithms to see if there's any 
advantage there, but I know they still beat my parallelLCP.  Anyway I think 
the net result, if I'm reading the right section, is that the original O(N^3) 
process can be done with O(N^3) processors in O(N) time.  The "processors" in 
this case need to know only multiply and add, I believe.  Probably more useful 
for a FPGA than a CPU, really.  I thought it was interesting :)

-- 
------------
email: duhprey at tosos.com www: http://paradox.tosos.com/ icq: 129354442
Computer Science is no more about computers than astronomy is about telescopes. Dijkstra
The European finds intercourse with Americans easy and agreeable.  Einstein
Not a shred of evidence exists in favor of the idea that life is serious.  Gill