[Beowulf] mem consumption strategy for HPC apps?
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 pathscale.comFri Apr 15 11:15:15 PDT 2005
- Previous message: [Beowulf] mem consumption strategy for HPC apps?
- Next message: [Beowulf] mem consumption strategy for HPC apps?
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Thu, Apr 14, 2005 at 08:59:34AM +0200, Toon Knapen wrote: > Next we all know about > the famous performance-memory tradeoff which says that performance can > be improved by consuming more memory and vice versa. No, I _don't_ know that one. Often you have to write extra code to trade off memory for performance, or it takes so much memory that there's practical no way to improve performance by using more memory. In addition, it's fairly rare for HPC applications to use more memory than a machine physically has. Perhaps you work in one of those rare areas. One example I know of is NASTRAN, which solves a huge matrix that often doesn't fit in memory. But there's no tradeoff involved, either the matrix fits or it does not. Perhaps you were talking about the quality of the solution? -- greg
- Previous message: [Beowulf] mem consumption strategy for HPC apps?
- Next message: [Beowulf] mem consumption strategy for HPC apps?
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list
