[Pharo-project] speeding up BigNum/Fractions calculations using NativeBoost?

Lawson English lenglish5 at cox.net
Sat Mar 24 15:13:48 EDT 2012


I'd like to see how fast a Mandelbrot Set algorithm could be implemented 
in Squeak/Pharo by using NativeBoost to bypass the VM whenever possible. 
Is that a worthwhile optimization, do you think?


Lawson




More information about the Pharo-dev mailing list