skill-tree:pe:3:b
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | Last revisionBoth sides next revision | ||
skill-tree:pe:3:b [2020/07/14 00:48] – luciana | skill-tree:pe:3:b [2020/07/19 11:30] – external edit 127.0.0.1 | ||
---|---|---|---|
Line 24: | Line 24: | ||
* The Linpack benchmark is used, for example, to build the TOP 500 list of the currently fastest supercomputers, | * The Linpack benchmark is used, for example, to build the TOP 500 list of the currently fastest supercomputers, | ||
* For HPC users, however, synthetic tests to benchmark HPC cluster hardware (like the Linpack benchmark) are of less importance, because the emphasis lies on the determination of speedups and efficiencies of the parallel program they want to use | * For HPC users, however, synthetic tests to benchmark HPC cluster hardware (like the Linpack benchmark) are of less importance, because the emphasis lies on the determination of speedups and efficiencies of the parallel program they want to use | ||
- | * Comrephend | + | * Comprehend |
* What is the scalability of my program? | * What is the scalability of my program? | ||
* How many cluster nodes can be maximally used, before the efficiency drops to values which are unacceptable? | * How many cluster nodes can be maximally used, before the efficiency drops to values which are unacceptable? | ||
Line 49: | Line 49: | ||
* **Break-even considerations regarding the benchmark effort** | * **Break-even considerations regarding the benchmark effort** | ||
* Benchmarking also represents a certain effort, namely for providing the HPC resources and human time explicitly used for that purpose | * Benchmarking also represents a certain effort, namely for providing the HPC resources and human time explicitly used for that purpose | ||
- | * **Presenting fair speedups** | + | * **Presenting fair speedups** |
* For conventional speedup calculations the same version of an algorithm (the same program) is used to measure runtimes T(sequential) and T(parallel) but for fair speedup calculations the best known sequential algorithm to measure T(sequential) should be used | * For conventional speedup calculations the same version of an algorithm (the same program) is used to measure runtimes T(sequential) and T(parallel) but for fair speedup calculations the best known sequential algorithm to measure T(sequential) should be used | ||
- | * **Special features of current CPU architectures** | + | * **Special features of current CPU architectures** |
* Features like turbo boost and hyper-threading may influence benchmark results | * Features like turbo boost and hyper-threading may influence benchmark results | ||
* **Shared nodes** | * **Shared nodes** | ||
Line 60: | Line 60: | ||
# Subskills | # Subskills | ||
* [[skill-tree: | * [[skill-tree: | ||
+ | * [[skill-tree: |
skill-tree/pe/3/b.txt · Last modified: 2020/07/19 19:55 by lucy