linpack/hpl

Greg Lindahl lindahl at conservativecomputer.com
Tue Sep 25 13:07:57 EDT 2001


On Tue, Sep 25, 2001 at 08:22:41AM -0700, Shane Canon wrote:

> We are adjusting the problem
> size and block size primarily.

You need to set the problem size as large as possible.  If it were too
small, you'd see exactly what you report, namely that above a certain
# of nodes, it begins to suck.

To set the problem size, figure out how much memory per node you want
to use, sum it up, and figure out how big of an array you can then use
(sqrt and divide by the element size, which is double precision
complex, or 16 bytes.)

greg


_______________________________________________
Beowulf mailing list, Beowulf at beowulf.org
To change your subscription (digest mode or unsubscribe) visit http://www.beowulf.org/mailman/listinfo/beowulf



More information about the Beowulf mailing list