Global Information Lookup Global Information

Traversed edges per second information


The number of traversed edges per second (TEPS) that can be performed by a supercomputer cluster is a measure of both the communications capabilities and computational power of the machine. This is in contrast to the more standard metric of floating-point operations per second (FLOPS), which does not give any weight to the communication capabilities of the machine. The term first entered usage in 2010 with the advent of petascale computing, and has since been measured for many of the world's largest supercomputers.[1]

In this context, an edge is a connection between two vertices on a graph, and the traversal is the ability of the machine to communicate data between these two points. The standardized benchmark associated with Graph500, as of September, 2011, calls for executing graph generation and search algorithms on graphs as large as 1.1 Petabyte.[2]

The ability of an application to utilize a supercomputer cluster effectively depends not only on the raw speed of each processor, but also on the communication network. The importance of communication capability varies from application to application, but it is clear that the LINPACK benchmarks traditionally used for rating the FLOPS of supercomputers do not require the same communications capability as many scientific applications.[3] Therefore, alternative metrics that characterize the performance of a machine in a more holistic manner may be more relevant for many scientific applications, and may be desirable for making purchasing decisions.[4]

  1. ^ "The Graph 500 list". Archived from the original on 2011-12-27.
  2. ^ "Graph500 Benchmark Specification". Graph500. 15 September 2011. Archived from the original on 26 March 2015. Retrieved 11 July 2013.
  3. ^ Dongarra, Jack J. (2007), "The HPC Challenge Benchmark: A Candidate for Replacing Linpack in the Top500?", SPEC Benchmark Workshop (PDF)
  4. ^ "Better Benchmarking for Supercomputers". 28 December 2010.

and 17 Related for: Traversed edges per second information

Request time (Page generated in 0.9345 seconds.)

Traversed edges per second

Last Update:

The number of traversed edges per second (TEPS) that can be performed by a supercomputer cluster is a measure of both the communications capabilities and...

Word Count : 304

Mainframe computer

Last Update:

performance is measured in floating point operations per second (FLOPS) or in traversed edges per second or TEPS, metrics that are not very meaningful for...

Word Count : 3718

Graph500

Last Update:

performance metric used to rank the supercomputers is GTEPS (giga- traversed edges per second). Richard Murphy from Sandia National Laboratories, says that...

Word Count : 705

HPCG benchmark

Last Update:

Memory access pattern Preconditioned conjugate gradient method Traversed edges per second Hemsoth, Nicole (June 26, 2014). "New HPC Benchmark Delivers Promising...

Word Count : 413

LINPACK benchmarks

Last Update:

Challenge Benchmark Suite. With the advent of petascale computers, traversed edges per second have started to emerge as a complementary metric to FLOPS measured...

Word Count : 1929

IBM Blue Gene

Last Update:

the top position in the Graph500 list with over 250 GTEPS (giga traversed edges per second). Blue Gene/Q systems also topped the Green500 list of most energy...

Word Count : 5089

Euler tour technique

Last Update:

set of edges, the Euler tour representation (ETR) can be constructed in parallel as follows: We construct a symmetric list of directed edges: For each...

Word Count : 962

Scanline rendering

Last Update:

Active edge table entries are maintained in an X-sorted list, effecting a change when 2 edges cross. After updating edges, the active edge table is...

Word Count : 1058

External memory graph traversal

Last Update:

node and traverses every node with depth one. If there are no more unvisited nodes at the current depth, nodes at a higher depth are traversed. Eventually...

Word Count : 1558

Binary tree

Last Update:

In the pictured binary tree, the black, left, edges represent first child, while the blue, right, edges represent next sibling. This representation is...

Word Count : 5083

Speed of light

Last Update:

to 299,792,458 metres per second (approximately 300,000 kilometres per second; 186,000 miles per second; 671 million miles per hour). According to the...

Word Count : 15300

Tetrahedron

Last Update:

edges are of unit length, its remaining edges are two of length √2 and one of length √3, so all its edges are edges or diagonals of the cube. The cube can...

Word Count : 9437

Heliosphere

Last Update:

spacecraft measured a forty-fold sudden increase in plasma density. Voyager 2 traversed the heliopause on 5 November 2018. Because the heliopause marks the boundary...

Word Count : 6406

Huffman coding

Last Update:

the second queue. The remaining node is the root node; the tree has now been generated. Once the Huffman tree has been generated, it is traversed to generate...

Word Count : 4434

Slitherlink

Last Update:

used in lieu of the standard grid, with varying numbers of edges per vertex or vertices per polygon. These patterns include snowflake, Penrose, Laves and...

Word Count : 2623

Register allocation

Last Update:

allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure the calling convention...

Word Count : 5066

Convex hull algorithms

Last Update:

convex curve, it is easy to see that the vertices of the convex hull, when traversed along the boundary, produce the sorted order of the numbers x 1 , … ,...

Word Count : 2229

PDF Search Engine © AllGlobal.net