benchmark_for_computational1

Intel Xeon Gold 6212U testing with a Nokia Solutions and s AE-SER2U-B/AF1805.01 (3B06 BIOS) and ASPEED on CentOS Linux 7 via the Phoronix Test Suite.

Compare your own system(s) to this result file with the Phoronix Test Suite by running the command: phoronix-test-suite benchmark 1908150-HV-BENCHMARK29
Jump To Table - Results

Statistics

Remove Outliers Before Calculating Averages

Graph Settings

Prefer Vertical Bar Graphs

Table

Show Detailed System Result Table

Run Management

Result
Identifier
Performance Per
Dollar
Date
Run
  Test
  Duration
benchmark_for_computational_run
August 15 2019
  1 Hour, 7 Minutes
Only show results matching title/arguments (delimit multiple options with a comma):
Do not show results matching title/arguments (delimit multiple options with a comma):


benchmark_for_computational1OpenBenchmarking.orgPhoronix Test SuiteIntel Xeon Gold 6212U @ 2.40GHz (24 Cores / 48 Threads)Nokia Solutions and s AE-SER2U-B/AF1805.01 (3B06 BIOS)Intel Sky Lake-E DMI3 Registers6 x 32 GB DDR4-2933MHz Samsung M393A4K40CB2-CVF2 x 480GB INTEL SSDSC2KG48ASPEEDIntel I210 + Intel Device 37cc + 2 x Mellanox MT27800CentOS Linux 73.10.0-862.14.4.el7.x86_64 (x86_64)GNOME Shell 3.25.4X Server 1.19.5modesetting 1.19.5GCC 4.8.5 20150623 + CUDA 10.0xfs1024x768ProcessorMotherboardChipsetMemoryDiskGraphicsNetworkOSKernelDesktopDisplay ServerDisplay DriverCompilerFile-SystemScreen ResolutionBenchmark_for_computational1 PerformanceSystem Logs- --build=x86_64-redhat-linux --disable-libgcj --disable-libunwind-exceptions --enable-__cxa_atexit --enable-bootstrap --enable-checking=release --enable-gnu-indirect-function --enable-gnu-unique-object --enable-initfini-array --enable-languages=c,c++,objc,obj-c++,java,fortran,ada,go,lto --enable-plugin --enable-shared --enable-threads=posix --mandir=/usr/share/man --with-arch_32=x86-64 --with-linker-hash-style=gnu --with-tune=generic - Scaling Governor: acpi-cpufreq ondemand- SELinux + l1tf: Not affected + meltdown: Not affected + spec_store_bypass: Mitigation of SSB disabled via prctl and seccomp + spectre_v1: Mitigation of Load fences __user pointer sanitization + spectre_v2: Mitigation of IBRS (kernel)

benchmark_for_computational1hmmer: Pfam Database Searchmafft: Multiple Sequence Alignmentgmpbench: Total Timefhourstones: Complex Connect-4 Solvingbyte: Dhrystone 2scimark2: Compositecrafty: Elapsed Timetscp: AI Chess Performancenero2d: Total Timestockfish: Total Timeasmfish: 1024 Hash Memory, 26 Depthdcraw: RAW To PPM Image Conversionminion: Solitairesudokut: Total Timebenchmark_for_computational_run8.872.584854.701426435619109.93639.4179431501325270481.95523462765650056443.1370.4215.96OpenBenchmarking.org

Timed HMMer Search

This test searches through the Pfam database of profile hidden markov models. The search finds the domain structure of Drosophila Sevenless protein. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterTimed HMMer Search 2.3.2Pfam Database Searchbenchmark_for_computational_run246810SE +/- 0.09, N = 38.871. (CC) gcc options: -O2 -pthread -lhmmer -lsquid -lm

Timed MAFFT Alignment

This test performs an alignment of 100 pyruvate decarboxylase sequences. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterTimed MAFFT Alignment 7.392Multiple Sequence Alignmentbenchmark_for_computational_run0.58051.1611.74152.3222.9025SE +/- 0.10, N = 122.581. (CC) gcc options: -std=c99 -O3 -lm -lpthread

GNU GMP GMPbench

GMPbench is a test of the GMP 6.1.2 math library. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgGMPbench Score, More Is BetterGNU GMP GMPbench 6.1.2Total Timebenchmark_for_computational_run100020003000400050004854.701. (CC) gcc options: -O3 -fomit-frame-pointer -lm

Fhourstones

This integer benchmark solves positions in the game of Connect-4, as played on a vertical 7x6 board. By default, it uses a 64Mb transposition table with the twobig replacement strategy. Positions are represented as 64-bit bitboards, and the hash function is computed using a single 64-bit modulo operation, giving 64-bit machines a slight edge. The alpha-beta searcher sorts moves dynamically based on the history heuristic. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgKpos / sec, More Is BetterFhourstones 3.1Complex Connect-4 Solvingbenchmark_for_computational_run3K6K9K12K15KSE +/- 29.66, N = 3142641. (CC) gcc options: -O3

BYTE Unix Benchmark

This is a test of BYTE. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgLPS, More Is BetterBYTE Unix Benchmark 3.6Dhrystone 2benchmark_for_computational_run8M16M24M32M40MSE +/- 33639.91, N = 335619109.93

SciMark

This test runs the ANSI C version of SciMark 2.0, which is a benchmark for scientific and numerical computing developed by programmers at the National Institute of Standards and Technology. This test is made up of Fast Foruier Transform, Jacobi Successive Over-relaxation, Monte Carlo, Sparse Matrix Multiply, and dense LU matrix factorization benchmarks. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Compositebenchmark_for_computational_run140280420560700SE +/- 0.33, N = 3639.411. (CC) gcc options: -lm

Crafty

This is a performance test of Crafty, an advanced open-source chess engine. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgNodes Per Second, More Is BetterCrafty 25.2Elapsed Timebenchmark_for_computational_run2M4M6M8M10MSE +/- 666.63, N = 379431501. (CC) gcc options: -pthread -lstdc++ -fprofile-use -lm

TSCP

This is a performance test of TSCP, Tom Kerrigan's Simple Chess Program, which has a built-in performance benchmark. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgNodes Per Second, More Is BetterTSCP 1.81AI Chess Performancebenchmark_for_computational_run300K600K900K1200K1500KSE +/- 1905.00, N = 513252701. (CC) gcc options: -O3 -march=native

Open FMM Nero2D

This is a test of Nero2D, which is a two-dimensional TM/TE solver for Open FMM. Open FMM is a free collection of electromagnetic software for scattering at very large objects. This test profile times how long it takes to solve one of the included 2D examples. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterOpen FMM Nero2D 2.0.2Total Timebenchmark_for_computational_run100200300400500SE +/- 3.15, N = 3481.951. (CXX) g++ options: -O2 -lfftw3 -llapack -lblas -lgfortran -lquadmath -lm -lmpicxx -lmpi

Stockfish

This is a test of Stockfish, an advanced C++11 chess benchmark that can scale up to 128 CPU cores. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgNodes Per Second, More Is BetterStockfish 9Total Timebenchmark_for_computational_run11M22M33M44M55MSE +/- 621188.47, N = 3523462761. (CXX) g++ options: -m64 -lpthread -fno-exceptions -std=c++11 -pedantic -O3 -msse -msse3 -mpopcnt -flto

asmFish

This is a test of asmFish, an advanced chess benchmark written in Assembly. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgNodes/second, More Is BetterasmFish 2018-07-231024 Hash Memory, 26 Depthbenchmark_for_computational_run12M24M36M48M60MSE +/- 413826.23, N = 356500564

dcraw

This test times how long it takes to convert several high-resolution RAW NEF image files to PPM image format using dcraw. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterdcrawRAW To PPM Image Conversionbenchmark_for_computational_run1020304050SE +/- 0.02, N = 343.131. (CC) gcc options: -lm

Minion

Minion is an open-source constraint solver that is designed to be very scalable. This test profile uses Minion's integrated benchmarking problems to solve. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterMinion 1.8Solitairebenchmark_for_computational_run1632486480SE +/- 0.07, N = 370.421. (CXX) g++ options: -std=gnu++11 -O3 -fomit-frame-pointer -rdynamic

Sudokut

This is a test of Sudokut, which is a Sudoku puzzle solver written in Tcl. This test measures how long it takes to solve 100 Sudoku puzzles. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterSudokut 0.4Total Timebenchmark_for_computational_run48121620SE +/- 0.00, N = 315.96