Performance of various computers using standard linear equations software
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
This report compares the performance of different computer systems in solving dense systems of linear equations. The comparison involves approximately a hundred computers, ranging from a CRAY Y-MP to scientific workstations such as the Apollo and Sun to IBM PCs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Basic Linear Algebra Subprograms for Fortran Usage
Lawson, C. L., Hanson, R. J., Kincaid, D. R., & Krogh, F. T. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355841.355847 · Cited by 1,634
Klema, V., Dongarra, J. J., Bunch, J. R., Moler, C. B., & Stewart, G. W. (1980) · Mathematics of Computation · doi:10.2307/2006212 · Cited by 646
Self-citationSolving Linear Systems on Vector and Shared Memory Computers.
Ortega, J. M., Dongarra, J. J., Duff, I. S., Sorensen, D. C., & van der Vorst, H. A. (1992) · Mathematics of Computation · doi:10.2307/2153226 · Cited by 437
Self-citationSqueezing the most out of an algorithm in CRAY FORTRAN
Dongarra, J. J., & Eisenstat, S. C. (1984) · ACM Transactions on Mathematical Software · doi:10.1145/1271.319413 · Cited by 153
Self-citationLinear algebra on high performance computers
Dongarra, J. J., & Sorensen, D. C. (1986) · Applied Mathematics and Computation · doi:10.1016/0096-3003(86)90126-8 · Cited by 64
Self-citation
Cited by
Global Optimization of Statistical Functions with Simulated Annealing
Goffe, W. L., Ferrier, G. D., & Rogers, J. (1994) · Journal of Econometrics · doi:10.1016/0304-4076(94)90038-8 · Cited by 1,610
Active messages: a mechanism for integrated communication and computation
von Eicken, T., Culler, D. E., Goldstein, S. C., & Schauser, K. E. (1992) · Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92 · doi:10.1145/139669.140382 · Cited by 1,393
Brook for GPUs: stream computing on graphics hardware
Buck, I., Foley, T., Horn, D., Sugerman, J., Fatahalian, K., Houston, M., & Hanrahan, P. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015800 · Cited by 1,155
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0056 · Cited by 1,135
ACEMD: Accelerating Biomolecular Dynamics in the Microsecond Time Scale
Harvey, M. J., Giupponi, G., & Fabritiis, G. D. (2009) · Journal of Chemical Theory and Computation · doi:10.1021/ct9000685 · Cited by 919
A genetic algorithm for the vehicle routing problem
Baker, B. M., & Ayechew, M. A. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00051-5 · Cited by 883
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0057 · Cited by 844
The LINPACK Benchmark: past, present and future
Dongarra, J. J., Luszczek, P., & Petitet, A. (2003) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.728 · Cited by 813
“In practice, as Table 3 shows, there may be a significant difference between peak theoretical and actual performance [14].”
BackgroundSelf-citationA Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012) · Operations Research · doi:10.1287/opre.1120.1048 · Cited by 709
A genetic algorithm for the set covering problem
Beasley, J. E., & Chu, P. C. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(95)00159-x · Cited by 635
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Beowulf Cluster Computing with Linux
(2001) · The MIT Press eBooks · doi:10.7551/mitpress/1556.001.0001 · Cited by 383
Relevance of accurate Monte Carlo modeling in nuclear medical imaging
Zaidi, H. (1999) · Medical Physics · doi:10.1118/1.598559 · Cited by 279
A theoretician’s guide to the experimental analysis of algorithms
Johnson, D. (2002) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/059/11 · Cited by 261
Technical Progress and Co-Invention in Computing and in the Uses of Computers
Bresnahan, T., Greenstein, S., Brownstone, D., & Flamm, K. (1996) · Brookings Papers on Economic Activity. Microeconomics · doi:10.2307/2534746 · Cited by 254
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
Gustavson, F. G. (1997) · IBM Journal of Research and Development · doi:10.1147/rd.416.0737 · Cited by 229
“For DGETRF, this is the TPP (Toward Peak Performance) benchmark [ 12 ].”
MethodHeuristic algorithms for the cardinality constrained efficient frontier
Woodside-Oriakhi, M., Lucas, C., & Beasley, J. E. (2011) · European Journal of Operational Research · doi:10.1016/j.ejor.2011.03.030 · Cited by 195
Metadata
- Authors
- Dongarra, J. J.
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 1992-06
- Volume
- 20
- Issue
- 3
- Pages
- 22-44
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W2078637295
- Cited by
- 708
- References
- 5
- FWCI
- 40.23
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.