Hi, With Fib, memory allocation & garbage collection dominate the execution time. The runtime creates objects internally for each async in your code. You probably also create a Fib object for each computation step.
The performance of the JVM GC in this context is much better than the one of the C++ backend. You can verify this by profiling the generated binary. I routinely do this using google performance tools. Bottom line, the very fine granularity of asyncs in Fib cannot give you good scalability with the current runtime. You need to have *enough* sequential computation in each async, e.g., compute Fib(n) sequentially for n<=MIN for some constant MIN. Regards, Olivier ------------------------------------------------------------------------------ This SF.net email is sponsored by Sprint What will you do first with EVO, the first 4G phone? Visit sprint.com/first -- http://p.sf.net/sfu/sprint-com-first _______________________________________________ X10-users mailing list X10-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/x10-users
