Living Reference Work Entry

Encyclopedia of Social Network Analysis and Mining

pp 1-11

Date: Latest Version

Benchmarking for Graph Clustering and Partitioning

  • David A. BaderAffiliated withSchool of Computational Science and Engineering, Georgia Institute of Technology Email author 
  • , Andrea KappesAffiliated withInstitute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT)
  • , Henning MeyerhenkeAffiliated withInstitute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT)
  • , Peter SandersAffiliated withInstitute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT)
  • , Christian SchulzAffiliated withInstitute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT)
  • , Dorothea WagnerAffiliated withInstitute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT)

Synonyms

Algorithm evaluation; Graph repository; Test instances.​

Glossary

Benchmarking

Performance evaluation for comparison to the state of the art.

Benchmark suite

Set of instances used for benchmarking.

Definition

Benchmarking refers to a repeatable performance evaluation as a means to compare somebody’s work to the state of the art in the respective field. As an example, benchmarking can compare the computing performance of new and old hardware.

In the context of computing, many different benchmarks of various sorts have been used. A prominent example is the Linpack benchmark of the TOP500 list of the fastest computers in the world, which measures the performance of the hardware by solving a dense linear algebra problem. Different categories of benchmarks include sequential versus parallel, microbenchmark versus application, or fixed code versus informal problem description. See, e.g., (Weicker 2002) for a more detailed treatment of hardware evaluation.

When it comes to benchmarking algorith ...

This is an excerpt from the content