Tetsu Soh <tetsu.soh....@gmail.com> wrote on 07/14/2010 02:57:32 AM:
>
> However, I have two more questions.
> 1)
> > For the duration of the X10 program, "idle" workers are constantly
> searching for work.
> Does it mean that thread is polling to find a job?
>
> 2)
> I found that the sequential Fibonacci program runs much slower with 24
> threads than with 1 thread. Following shows the results.
> -INIT_THREADS=24, execution time of Fib(40) =108.35 sec
> -INIT_THREADS=1, execution time of Fib(40) =8.16 sec
> It means that the sequential program in X10 performs bad on multi-core
> platform. Is it related to the fork/join scheduler implementation?
>
> Regards,
> -Tetsu
Not sure if you would have found these (there more buried then they should
be), but we had an X10 day back in April. All of the presentations are
online here: http://docs.codehaus.org/display/XTENLANG/X10+Day. In
particular, you might want to take a look through the presentation on the
X10 runtime given by Olivier Tardieu and David Cunningham (
http://docs.codehaus.org/download/attachments/140575067/X10_Runtime.pdf?version=2&modificationDate=1271426365763).
------------------------------------------------------------------------------
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
