On Sat, May 24, 2008 at 6:48 AM, Olivier Teytaud <[EMAIL PROTECTED]> wrote: > > By the way, parallelizations (both multi-core and MPI) are *very* efficient. > The use of huge clusters could probably give much better > results than the current limit of mogo (between 1k and 1d on KGS with > 64 quad-cores and myrinet switch).
This is rather off-topic, but I am very interested in this field of research. I had read previously that Mogo used MPI, but I didn't know if could work on clusters without sharing the whole tree. I have been formulating such an algorithm for the past week or so, so I would like to make sure that it hasn't already been done. Has anything been written about Mogo's parallel algorithms? Or could you give a brief run-down? How does it scale on such large numbers of processors? _______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
