[Beowulf] Performance characterising a HPC application
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 greg.lindahl at qlogic.comWed Mar 21 14:04:39 PDT 2007
- Previous message: [Beowulf] The recently solved Lie Group problem E8
- Next message: [Beowulf] The recently solved Lie Group problem E8
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Wed, Mar 21, 2007 at 01:45:42PM -0700, Paul Jackson wrote: > Mark wrote: > > but I also can't find this code > > I re-introduced myself to some search engines other than google, and > found the following links relating to nxnlatbw. Oh, my fading memory. I guess it isn't a part of MPICH after all! Looks like we cobbled it together using the same algorithm used by OSU's latency and bw benchmarks. See, Mark, if you'd bought our interconnect, you'd know about this test! ;-) -- greg
- Previous message: [Beowulf] The recently solved Lie Group problem E8
- Next message: [Beowulf] The recently solved Lie Group problem E8
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list