linpack/hpl
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Greg Lindahl lindahl at conservativecomputer.comTue Sep 25 10:07:57 PDT 2001
- Previous message: linpack/hpl
- Next message: linpack/hpl
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
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
- Previous message: linpack/hpl
- Next message: linpack/hpl
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list
