| http://dbpedia.org/ontology/abstract
|
The HPCG (high performance conjugate gradi … The HPCG (high performance conjugate gradient) benchmark is a supercomputing benchmark test proposed by Michael Heroux from Sandia National Laboratories, and Jack Dongarra and Piotr Luszczek from the University of Tennessee. It is intended to model the data access patterns of real-world applications such as sparse matrix calculations, thus testing the effect of limitations of the memory subsystem and internal interconnect of the supercomputer on its computing performance. Because it is internally I/O bound (the data for the benchmark resides in main memory as it is too large for processor caches), HPCG testing generally achieves only a tiny fraction of the peak FLOPS the computer could theoretically deliver. HPCG is intended to complement benchmarks such as the LINPACK benchmarks that put relatively little stress on the internal interconnect. The source of the HPCG benchmark is available on GitHub. As of June 2018, the Summit supercomputer held the top spot in the HPCG performance rankings, followed by the Sierra and the K computer. In November of 2020 they were superseded by Fugaku with a speed of 16.0 HPCG-petaflops, an increase of 540% over Summit.etaflops, an increase of 540% over Summit.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://github.com/hpcg-benchmark/hpcg/ +
, http://www.hpcg-benchmark.org/ +
|
| http://dbpedia.org/ontology/wikiPageID
|
50991783
|
| http://dbpedia.org/ontology/wikiPageLength
|
3897
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1090638877
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/FLOPS +
, http://dbpedia.org/resource/I/O_bound +
, http://dbpedia.org/resource/K_computer +
, http://dbpedia.org/resource/Graph500 +
, http://dbpedia.org/resource/Supercomputing +
, http://dbpedia.org/resource/Category:Benchmarks_%28computing%29 +
, http://dbpedia.org/resource/Memory +
, http://dbpedia.org/resource/Sierra_%28supercomputer%29 +
, http://dbpedia.org/resource/Sandia_National_Laboratories +
, http://dbpedia.org/resource/Preconditioned_conjugate_gradient_method +
, http://dbpedia.org/resource/Category:Parallel_computing +
, http://dbpedia.org/resource/Application_software +
, http://dbpedia.org/resource/Memory_access_pattern +
, http://dbpedia.org/resource/GitHub +
, http://dbpedia.org/resource/Summit_%28supercomputer%29 +
, http://dbpedia.org/resource/Traversed_edges_per_second +
, http://dbpedia.org/resource/Jack_Dongarra +
, http://dbpedia.org/resource/Category:Supercomputer_benchmarks +
, http://dbpedia.org/resource/Benchmark_%28computing%29 +
, http://dbpedia.org/resource/Interconnect_%28computing%29 +
, http://dbpedia.org/resource/University_of_Tennessee +
, http://dbpedia.org/resource/Data_access +
, http://dbpedia.org/resource/LINPACK_benchmarks +
, http://dbpedia.org/resource/Fugaku_%28supercomputer%29 +
, http://dbpedia.org/resource/Sparse_matrix +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Authority_control +
, http://dbpedia.org/resource/Template:Computing-stub +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Parallel_computing +
, http://dbpedia.org/resource/Category:Benchmarks_%28computing%29 +
, http://dbpedia.org/resource/Category:Supercomputer_benchmarks +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/HPCG_benchmark?oldid=1090638877&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/HPCG_benchmark +
|
| owl:sameAs |
http://yago-knowledge.org/resource/HPCG_benchmark +
, https://global.dbpedia.org/id/2PUGu +
, http://www.wikidata.org/entity/Q25345993 +
, http://dbpedia.org/resource/HPCG_benchmark +
|
| rdfs:comment |
The HPCG (high performance conjugate gradi … The HPCG (high performance conjugate gradient) benchmark is a supercomputing benchmark test proposed by Michael Heroux from Sandia National Laboratories, and Jack Dongarra and Piotr Luszczek from the University of Tennessee. It is intended to model the data access patterns of real-world applications such as sparse matrix calculations, thus testing the effect of limitations of the memory subsystem and internal interconnect of the supercomputer on its computing performance. Because it is internally I/O bound (the data for the benchmark resides in main memory as it is too large for processor caches), HPCG testing generally achieves only a tiny fraction of the peak FLOPS the computer could theoretically deliver. the computer could theoretically deliver.
|
| rdfs:label |
HPCG benchmark
|
