Home > Papers > Parallel Fractals Introduction | Mandelbrot Set | Image Characteristics | Parallel Algorithm Design | Partitioning | Agglomeration | Output Synchronization | Token-Passing | Polling | Performance Analysis | Conclusion | Bibliography | Slides |
||

Parallel Fractal Image GenerationPartitioning
As we saw in the first part, a fractal image is computed the following way: FOR each line FOR each column in the line WHILE NOT maximum iteration count reached AND NOT The first phase in the design of the parallel algorithm is to partition the problem into its elementary parts [IF95]. In this case, the most elementary part is performing one iteration of the formula on one point. |

© 2001 Matthias Book |