On Mon, May 11, 2009 at 05:56:43PM -0400, Gus Correa wrote: > However, here is somebody that did an experiment with increasing > values of N, and his results suggest that performance increases > logarithmically with problem size (N), not linearly, > saturating when you get closer to the maximum possible for your > current memory size.
This is well-known. And of course faster interconnect means that you get closer to peak at smaller problem sizes. -- greg _______________________________________________ Beowulf mailing list, Beowulf@beowulf.org sponsored by Penguin Computing To change your subscription (digest mode or unsubscribe) visit http://www.beowulf.org/mailman/listinfo/beowulf
