![]() | Dieter, We never expected the parallel NONMEM to perform well with problems of this size. The benefit, in our early benchmarks, really starts with problems that are at least 20 minutes. The math is pretty simple, basically, if a function evaluation takes more than a about a half second (not that a "typical" nonmem run may have 3000 function evaluations), it is worth sending out to multiple processes. That was our conclusion with the file-based method, the MPI might be more efficient (but, I'm told that behind the curtains, they both do pretty much the same thing, the OS buffers data blocks of this size very well, the data never actually goes to the physical disc). Our early benchmark were also with multiple computers, across a 100 Mb/s LAN. Likely there is also better performance with the very clever load balancing and dynamic sizing that Bob Bauer has put into the new release. But, don't expect any benefit with 1 minute runs, there is I/O overhead involved with sending out the data, even on the same CPU. Note that our benchmarks had a base run time of 6 hours. See our poster at http://2009.go-acop.org/acop2009/posters. Mark A carbon-neutral company See our real time solar energy production at:
|
RE: [NMusers] Simple parallel benchmark for Nonmem 7.2 with large Bayes problem
Mark Sale - Next Level Solutions Fri, 20 May 2011 14:08:14 -0700
- [NMusers] Simple parallel benchmark for N... Dieter Menne
- Re: [NMusers] Simple parallel benchm... Ron Keizer
- Re: [NMusers] Simple parallel be... Nick Holford
- Re: [NMusers] Simple paralle... Ron Keizer
- RE: [NMusers] Simple paralle... Woot De Trixhe, Xavier [PRDBE]
- Re: [NMusers] Simple par... Ron Keizer
- RE: [NMusers] Simpl... Woot De Trixhe, Xavier [PRDBE]
- RE: [NMusers] Simple parallel benchm... Mark Sale - Next Level Solutions

