On Fri, 30 Oct 2009, Roy Stogner wrote:
> My best idea so far: > > Processor 2*N+1 sends its set to Processor 2*N, which unions it with > its own set. > Processor 4*N+2 sends its set to Processor 4*N, which unions it with > its own set. > (repeat until you run out of processors) Ben pointed out that if we directly gather everything to processor 0 at once, although it would require more communication in total, it wouldn't insert those log_2(N_procs) barriers to that communication, and thus it might be faster. I then realized that, faster or not, writing one line of code to call an already-tested function is definitely lazier, so I'm going with that. --- Roy ------------------------------------------------------------------------------ Come build with us! The BlackBerry(R) Developer Conference in SF, CA is the only developer event you need to attend this year. Jumpstart your developing skills, take BlackBerry mobile applications to market and stay ahead of the curve. Join us from November 9 - 12, 2009. Register now! http://p.sf.net/sfu/devconference _______________________________________________ Libmesh-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/libmesh-devel
