Computational forces in the Linpack benchmark
Saved in:
| Title: | Computational forces in the Linpack benchmark |
|---|---|
| Authors: | Numrich, Robert W.1 rwn@msi.umn.edu |
| Source: | Journal of Parallel & Distributed Computing. Sep2008, Vol. 68 Issue 9, p1283-1290. 8p. |
| Subjects: | LINPACK (Computer system), Dimensional analysis, Multivariate analysis, Algorithms, Scalability, Computer networks, Computer programmers |
| Abstract: | Abstract: Dimensional analysis reduces a complicated ten-parameter formula for the execution time of the Linpack benchmark to a simpler two-parameter formula. These two parameters are ratios of software forces and hardware forces that determine a self-similarity surface. Machines move along paths on this surface as the problem size and the number of processors change. Two machines scale the same way, they move along the same path, if they have the same hardware forces. To design efficient algorithms, the programmer must produce software forces large enough to overcome the hardware forces. Modern machines have larger hardware forces than older machines and are harder to program. [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!
