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 |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 33890420 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Computational forces in the Linpack benchmark – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Numrich%2C+Robert+W%2E%22">Numrich, Robert W.</searchLink><relatesTo>1</relatesTo><i> rwn@msi.umn.edu</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Parallel+%26+Distributed+Computing%22">Journal of Parallel & Distributed Computing</searchLink>. Sep2008, Vol. 68 Issue 9, p1283-1290. 8p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22LINPACK+%28Computer+system%29%22">LINPACK (Computer system)</searchLink><br /><searchLink fieldCode="DE" term="%22Dimensional+analysis%22">Dimensional analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Multivariate+analysis%22">Multivariate analysis</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+networks%22">Computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programmers%22">Computer programmers</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=33890420 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1016/j.jpdc.2008.02.008 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 8 StartPage: 1283 Subjects: – SubjectFull: LINPACK (Computer system) Type: general – SubjectFull: Dimensional analysis Type: general – SubjectFull: Multivariate analysis Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Scalability Type: general – SubjectFull: Computer networks Type: general – SubjectFull: Computer programmers Type: general Titles: – TitleFull: Computational forces in the Linpack benchmark Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Numrich, Robert W. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2008 Type: published Y: 2008 Identifiers: – Type: issn-print Value: 07437315 Numbering: – Type: volume Value: 68 – Type: issue Value: 9 Titles: – TitleFull: Journal of Parallel & Distributed Computing Type: main |
| ResultId | 1 |
