<p>If your algorithm is fundamentally sequential, you can't make it fundamentally not that.</p>

<p>What is the algorithm you are using?</p>

<p>EDIT: Googling "diffusion limited aggregation algorithm parallel" lead me <a href="http://arxiv.org/abs/comp-gas/9609001" rel="nofollow noreferrer">here</a>, with the following quote:</p>

<blockquote>
  <p>DLA, on the other hand, has been shown
  [9,10] to belong to the class of
  inherently sequential or, more
  formally, P-complete problems.
  Therefore, it is unlikely that DLA
  clusters can be sampled in parallel in
  polylog time when restricted to a
  number of processors polynomial in the
  system size.</p>
</blockquote>

<p>So the answer to your question is "all signs point to no".</p>
Possible to distribute or parallel process a sequential program?
<p>In C++, I've written a mathematical program (for diffusion limited aggregation) where each new point calculated is dependent on all of the preceding points.
Is it possible to have such a program work in a parallel or distributed manner to increase computing speed?
If so, what type of modifications to the code would I need to look into?</p>

<p>EDIT: My source code is available at...
<a href="http://www.bitbucket.org/damigu78/brownian-motion/downloads/" rel="nofollow noreferrer">http://www.bitbucket.org/damigu78/brownian-motion/downloads/</a>
filename is DLA_full3D.cpp
I don't mind significant re-writes if that's what it would take.  After all, I want to learn how to do it.</p>