search

johnny-morrice / godelbrot

Unix-style Mandelbrot set renderer in Golang
MIT License
8 stars 1 forks source link

Optimize arbitrary precision sequence render #30

Closed johnny-morrice closed 8 years ago

johnny-morrice commented 8 years ago

Arbitrary precision render is so slow that it is unusable in anything but the smallest bit-precision.

Look into dividing the bit-precision by a constant "fudge" factor.

Profile the big sequence algorithm and find out why it is so slow.

If after eliminating garbage and other clumsiness, it is still too slow, we can look into doing the Mandelbrot Escape algorithm with bit-level composition of operations over an array.

johnny-morrice commented 8 years ago

It would be easy to introduce some concurrency. But the big picture is that we will render zoom movies in parallel anyway, so that is wasted effort and would hamper the ability of higher level processes to control concurrency/parallelism.

johnny-morrice commented 8 years ago

There is no garbage. The bit count is low. It's just slow, man, crunching those numbers. Shall look into a faster way of doing squares on long numbers.

johnny-morrice commented 8 years ago

This is a difficult endeavour. Looking into new algorithms instead.