翻訳と辞書
Words near each other
・ Graphical tools
・ Graphical unitary group approach
・ Graphical user interface
・ Graphical user interface builder
・ Graphical user interface elements
・ Graph structure theorem
・ Graph Style Sheets
・ Graph theory
・ Graph theory in enzymatic kinetics
・ Graph toughness
・ Graph traversal
・ Graph-based access control
・ GRaPH-Int
・ Graph-structured stack
・ Graph-tool
Graph500
・ Graphalloy
・ Graphane
・ Graphania
・ Graphania insignis
・ Graphania lignana
・ Graphania lithias
・ Graphania maya
・ Graphania mollis
・ Graphania morosa
・ Graphania mutans
・ Graphania nullifera
・ Graphania olivea
・ Graphania oliveri
・ Graphania omicron


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Graph500 : ウィキペディア英語版
The Graph500 is a rating of supercomputer systems, focused on Data intensive loads. The project was announced on International Supercomputing Conference in June 2010. The first list was published at the ACM/IEEE Supercomputing Conference in November 2010. New versions of the list are published twice a year. The main performance metric used to rank the supercomputers is GTEPS (10^9 Traversed edges per second).Richard Murphy from Sandia, says that "The Graph500's goal is to promote awareness of complex data problems", instead of focusing on computer benchmarks like HPL (High Performance Linpack), which Top500 is based on.Despite its name, there were several hundreds of systems in the rating, growing up to 174 in June 2014.http://www.graph500.org/results_jun_2014There is also list Green Graph 500, which uses same performance metric, but sorts list according to performance per Watt, like Green 500 works with Top500 (HPL).== Benchmark ==The benchmark used in Graph500 stresses the communication subsystem of the system, instead of counting double precision floating-point. It is based on a breadth-first search in a large undirected graph (model of Kronecker graph with average degree of 16). There are two computation kernels in the benchmark: the first kernel is to generate the graph and compress it into sparse structures CSR or CSC (Compressed Sparse Row/Column); the second kernel does a parallel BFS search of some random vertices (64 search iterations per run). Six possible sizes (Scales) of graph are defined: toy (2^26 vertices; 17 GB of RAM), mini (2^29; 137 GB), small (2^32; 1,1 TB), medium (2^36; 17,6 TB), large (2^39; 140 TB), huge (2^42; 1.1 PB of RAM).(Performance Evaluation of Graph500 on Large-Scale Distributed Environment ) // IEEE IISWC 2011, Austin, TX; (presentation )The reference implementation of the benchmark contains several versions:(【引用サイトリンク】title= Graph500: адекватный рейтинг )* serial high-level in GNU Octave* serial low-level in C* parallel C version with usage of OpenMP* two versions for Cray-XMT* basic MPI version (with MPI-1 functions)* optimized MPI version (with MPI-2 one-sided communications)
The Graph500 is a rating of supercomputer systems, focused on Data intensive loads. The project was announced on International Supercomputing Conference in June 2010. The first list was published at the ACM/IEEE Supercomputing Conference in November 2010. New versions of the list are published twice a year. The main performance metric used to rank the supercomputers is GTEPS (10^9 Traversed edges per second).
Richard Murphy from Sandia, says that "The Graph500's goal is to promote awareness of complex data problems", instead of focusing on computer benchmarks like HPL (High Performance Linpack), which Top500 is based on.
Despite its name, there were several hundreds of systems in the rating, growing up to 174 in June 2014.〔http://www.graph500.org/results_jun_2014〕
There is also list Green Graph 500, which uses same performance metric, but sorts list according to performance per Watt, like Green 500 works with Top500 (HPL).
== Benchmark ==
The benchmark used in Graph500 stresses the communication subsystem of the system, instead of counting double precision floating-point.〔 It is based on a breadth-first search in a large undirected graph (model of Kronecker graph with average degree of 16). There are two computation kernels in the benchmark: the first kernel is to generate the graph and compress it into sparse structures CSR or CSC (Compressed Sparse Row/Column); the second kernel does a parallel BFS search of some random vertices (64 search iterations per run). Six possible sizes (Scales) of graph are defined: toy (2^26 vertices; 17 GB of RAM), mini (2^29; 137 GB), small (2^32; 1,1 TB), medium (2^36; 17,6 TB), large (2^39; 140 TB), huge (2^42; 1.1 PB of RAM).〔(Performance Evaluation of Graph500 on Large-Scale Distributed Environment ) // IEEE IISWC 2011, Austin, TX; (presentation )〕
The reference implementation of the benchmark contains several versions:〔(【引用サイトリンク】title= Graph500: адекватный рейтинг )
* serial high-level in GNU Octave
* serial low-level in C
* parallel C version with usage of OpenMP
* two versions for Cray-XMT
* basic MPI version (with MPI-1 functions)
* optimized MPI version (with MPI-2 one-sided communications)

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「The Graph500 is a rating of supercomputer systems, focused on Data intensive loads. The project was announced on International Supercomputing Conference in June 2010. The first list was published at the ACM/IEEE Supercomputing Conference in November 2010. New versions of the list are published twice a year. The main performance metric used to rank the supercomputers is GTEPS (10^9 Traversed edges per second).Richard Murphy from Sandia, says that "The Graph500's goal is to promote awareness of complex data problems", instead of focusing on computer benchmarks like HPL (High Performance Linpack), which Top500 is based on.Despite its name, there were several hundreds of systems in the rating, growing up to 174 in June 2014.http://www.graph500.org/results_jun_2014There is also list Green Graph 500, which uses same performance metric, but sorts list according to performance per Watt, like Green 500 works with Top500 (HPL).== Benchmark ==The benchmark used in Graph500 stresses the communication subsystem of the system, instead of counting double precision floating-point. It is based on a breadth-first search in a large undirected graph (model of Kronecker graph with average degree of 16). There are two computation kernels in the benchmark: the first kernel is to generate the graph and compress it into sparse structures CSR or CSC (Compressed Sparse Row/Column); the second kernel does a parallel BFS search of some random vertices (64 search iterations per run). Six possible sizes (Scales) of graph are defined: toy (2^26 vertices; 17 GB of RAM), mini (2^29; 137 GB), small (2^32; 1,1 TB), medium (2^36; 17,6 TB), large (2^39; 140 TB), huge (2^42; 1.1 PB of RAM).(Performance Evaluation of Graph500 on Large-Scale Distributed Environment ) // IEEE IISWC 2011, Austin, TX; (presentation )The reference implementation of the benchmark contains several versions:(【引用サイトリンク】title= Graph500: адекватный рейтинг )* serial high-level in GNU Octave* serial low-level in C* parallel C version with usage of OpenMP* two versions for Cray-XMT* basic MPI version (with MPI-1 functions)* optimized MPI version (with MPI-2 one-sided communications)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.