[Beowulf] evaluating FLOPS capacity of our cluster

Greg Lindahl lindahl at pbm.com
Mon May 11 15:28:14 PDT 2009

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

More information about the Beowulf mailing list