Group Abstract Group Abstract

Message Boards Message Boards

0
|
8.1K Views
|
6 Replies
|
4 Total Likes
View groups...
Share
Share this post:

how to decipher some Mathematica terminology regarding system performance

Posted 11 years ago
POSTED BY: Gary Lewis
6 Replies
Posted 11 years ago

Daniel, Sean, and Bruce - Thanks to each of you for your detailed and helpful replies. I very much appreciate your help. You've provided me with enough leads and ideas to move forward. At least as far as I'm concerned, please consider this help request closed.

POSTED BY: Gary Lewis
POSTED BY: Bruce Miller
POSTED BY: Sean Clarke
Posted 11 years ago

Daniel - Thanks for your reply. Let me ask the question in another way. Does Wolfram do benchmark studies of Mathematica across the 3 editions of Mathematica (Home, Starter, and Standard)? Even better, does Wolfram also do that across a representative sample of hardware?

Maybe the answers are proprietary. If so, please ignore.

I'm simply trying to diagnose what I believe is slow performance due to computation limitations. Here's an example. One recent project dealt with the synchronization of phase coupled oscillators (Kuramoto model). So lots of use of NDSolve, but a simple program. And even for a trial situation with small parameters (eg, number of oscillators, number of timesteps, and number of coupling strengths), the elapsed time is around 40 minutes. That seems excessive. System monitor shows 8 CPUs, with one pegged at 100% and the others near 0%, then a hand-off to another CPU, and so on.

POSTED BY: Gary Lewis

I simply do not know the answers regarding whether we, or others, have useful and recent benchmarks. The links below might be of some use but most, I think, are dated.

http://www.stats.uwo.ca/faculty/aim/epubs/benchmark/mathemat.htm

http://reference.wolfram.com/language/Benchmarking/ref/Benchmark.html

https://homepages.fhv.at/ku/karl/mma.html

http://www.scientificweb.de/mathstef3.html

If at all possible I would suggest posting as concise as possible a version of the slow code, either directly here or, if too large, in an attached notebook. That way you might get useful suggestions on speedup or at least diagnosis as to what might be the cause of the slowness. One thing I can say is that it might well be a problem for which parallelization is simply not a possibility, even at the linear algebra or related low level. But that does not imply there is no other hope for speed improvement, hence the suggestion that you try to post an example.

POSTED BY: Daniel Lichtblau

In general I would not expect the Standard version to perform significantly better than the Home edition. But there may be certain types of computation for which it does do better. If you provide examples that you believe are slow as compared to expectations then it might be possible to say something more concrete.

As for the terminology you cite, it applies mostly to explicitly parallelized code e.g. using ParallelMap. There may also be numeric linear algebra routines that are sensitive to number of available cores, but I do not think they are affected by the Home vs. Standard distinction.

I should mention that this is a bit outside my expertise. Others may be able to give more definitive responses.

POSTED BY: Daniel Lichtblau
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
Attachments
Remove
or Discard