A note on scaling the Linpack benchmark
Saved in:
| Title: | A note on scaling the Linpack benchmark |
|---|---|
| Authors: | Numrich, Robert W.1 rwn@msi.umn.edu |
| Source: | Journal of Parallel & Distributed Computing. Apr2007, Vol. 67 Issue 4, p491-498. 8p. |
| Subjects: | LINPACK (Computer system), Computer software, Computer simulation, Benchmarking (Management) |
| Abstract: | Abstract: Dimensional analysis yields a new scaling formula for the Linpack benchmark. The computational power on a set of processors decomposed into a grid determines the computational power on a set of processors decomposed into a grid by the formula . The two scaling parameters and measure interprocessor communication overhead required by the algorithm. A machine that scales perfectly corresponds to ; a machine that scales not at all corresponds to . We have determined the two scaling parameters by imposing a fixed-time constraint on the problem size such that the execution time remains constant as the number of processors changes. Results for a collection of machines confirm that the formula suggested by dimensional analysis is correct. Machines with the same values for these parameters are self-similar. They scale the same way even though the details of their specific hardware and software may be quite different. [Copyright &y& Elsevier] |
| Copyright of Journal of Parallel & Distributed Computing is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
