Paulo Costa wrote:
At 18:46 02/01/2008, willem wrote:
Vincent has made an improved Mandelbrot benchmark.
i did run the original mandelbrot benchmark with N =5000. It took 2:
20 minutes.
The improved version took 2:00 minutes.
If you see the gcc version you'll see that it relies on SSE2
willem schreef:
In mandelbrot.pas the Calulatatepoint is used. If you remove this
function then you can also gain speed.
I think I am missing something. How can you remove the calculatepoint? Of course it
would speed up, because 90% of the caclulations occur there. But these
calculations
Vincent Snijders wrote:
willem schreef:
In mandelbrot.pas the Calulatatepoint is used. If you remove this
function then you can also gain speed.
I think I am missing something. How can you remove the calculatepoint?
Of course it would speed up, because 90% of the caclulations occur
Sergei Gorelkin schreef:
willem wrote:
1 IF we take the mandelbrot paramet N = 5000 then Calculatepoint will
be called 2500 times.
andCalculatePoint pushes x*Step - 1.5,Cy on the stack.
then it executes the statements of CalculatePoint
and finally it pops a boolean from the stack.
It
willem wrote:
1 IF we take the mandelbrot paramet N = 5000 then Calculatepoint will be
called 2500 times.
andCalculatePoint pushes x*Step - 1.5,Cy on the stack.
then it executes the statements of CalculatePoint
and finally it pops a boolean from the stack.
It does not do any push's and
Sergei Gorelkin wrote:
willem wrote:
1 IF we take the mandelbrot paramet N = 5000 then Calculatepoint will
be called 2500 times.
andCalculatePoint pushes x*Step - 1.5,Cy on the stack.
then it executes the statements of CalculatePoint
and finally it pops a boolean from the stack.
It does
Vincent Snijders wrote:
Sergei Gorelkin schreef:
willem wrote:
1 IF we take the mandelbrot paramet N = 5000 then Calculatepoint
will be called 2500 times.
andCalculatePoint pushes x*Step - 1.5,Cy on the stack.
then it executes the statements of CalculatePoint
and finally it pops a
