test1

Docker testing on Clear Linux OS 24870 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 1810158-SK-TEST1569166
Jump To Table - Results

Statistics

Remove Outliers Before Calculating Averages

Graph Settings

Prefer Vertical Bar Graphs

Multi-Way Comparison

Condense Multi-Option Tests Into Single Result Graphs

Table

Show Detailed System Result Table

Run Management

Result
Identifier
View Logs
Performance Per
Dollar
Date
Run
  Test
  Duration
first
October 15 2018
  1 Hour, 18 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):


test1OpenBenchmarking.orgPhoronix Test SuiteAMD Ryzen 5 2400G @ 3.60GHz (4 Cores / 8 Threads)ASRock B450 Pro4 (P1.30 BIOS)15360MBSamsung SSD 970 EVO 250GBamdgpudrmfbClear Linux OS 248704.18.0-10-generic (x86_64)GCC 8.2.0 + Clang 6.0.1 + LLVM 6.0.1aufs1024x768DockerProcessorMotherboardMemoryDiskGraphicsOSKernelCompilerFile-SystemScreen ResolutionSystem LayerTest1 BenchmarksSystem Logs- --build=x86_64-generic-linux --disable-libmpx --disable-libunwind-exceptions --disable-multiarch --disable-vtable-verify --enable-__cxa_atexit --enable-bootstrap --enable-clocale=gnu --enable-gnu-indirect-function --enable-languages=c,c++,fortran,go --enable-ld=default --enable-libstdcxx-pch --enable-lto --enable-multilib --enable-plugin --enable-shared --enable-threads=posix --exec-prefix=/usr --includedir=/usr/include --target=x86_64-generic-linux --with-arch=westmere --with-glibc-version=2.19 --with-gnu-ld --with-isl --with-ppl=yes --with-tune=haswell - Scaling Governor: acpi-cpufreq ondemand- __user pointer sanitization + Full AMD retpoline IBPB + SSB disabled via prctl and seccomp

test1hmmer: Pfam Database Searchmafft: Multiple Sequence Alignmentmrbayes: Primate Phylogeny Analysisgmpbench: Total Timefhourstones: Complex Connect-4 Solvingbyte: Dhrystone 2byte: Dhrystone 2byte: Integer Arithmeticbyte: Register Arithmeticbyte: Floating-Point Arithmeticscimark2: Compositescimark2: Monte Carloscimark2: Fast Fourier Transformscimark2: Sparse Matrix Multiplyscimark2: Dense LU Matrix Factorizationscimark2: Jacobi Successive Over-Relaxationscimark2: Compositecrafty: Elapsed Timetscp: AI Chess Performancedcraw: RAW To PPM Image Conversionminion: Gracefulminion: Solitaireminion: Quasigroupminion: Solitairesudokut: Total Timefirst9.885.342354695117863968817340419764111137166113325972346111713717018911103413821.1348.5176.5312776.4817.10OpenBenchmarking.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 Searchfirst3691215SE +/- 0.10, N = 39.88

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 Alignmentfirst1.20152.4033.60454.8066.0075SE +/- 0.05, N = 35.34

Timed MrBayes Analysis

This test performs a bayesian analysis of a set of primate genome sequences in order to estimate their phylogeny. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterTimed MrBayes Analysis 3.1.2Primate Phylogeny Analysisfirst50100150200250SE +/- 0.49, N = 3235

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 Timefirst100020003000400050004695

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 Solvingfirst3K6K9K12K15KSE +/- 26.56, N = 311786

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 2first8M16M24M32M40MSE +/- 277801.91, N = 339688173

OpenBenchmarking.orgLPS, More Is BetterBYTE Unix Benchmark 3.6Computational Test: Dhrystone 2first9M18M27M36M45MSE +/- 50769.45, N = 340419764

OpenBenchmarking.orgLPS, More Is BetterBYTE Unix Benchmark 3.6Computational Test: Integer Arithmeticfirst0.2250.450.6750.91.1251

OpenBenchmarking.orgLPS, More Is BetterBYTE Unix Benchmark 3.6Computational Test: Register Arithmeticfirst0.2250.450.6750.91.1251

OpenBenchmarking.orgLPS, More Is BetterBYTE Unix Benchmark 3.6Computational Test: Floating-Point Arithmeticfirst0.2250.450.6750.91.1251

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.0Computational Test: Compositefirst30060090012001500SE +/- 15.43, N = 31371

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Monte Carlofirst140280420560700SE +/- 1.01, N = 3661

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Fast Fourier Transformfirst306090120150SE +/- 0.91, N = 3133

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Sparse Matrix Multiplyfirst6001200180024003000SE +/- 72.43, N = 32597

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Dense LU Matrix Factorizationfirst5001000150020002500SE +/- 3.41, N = 32346

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Jacobi Successive Over-Relaxationfirst2004006008001000SE +/- 0.16, N = 31117

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Compositefirst30060090012001500SE +/- 15.43, N = 31371

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 Timefirst1.5M3M4.5M6M7.5MSE +/- 6511.48, N = 370189111. (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 Performancefirst200K400K600K800K1000KSE +/- 1451.61, N = 51034138

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 Conversionfirst510152025SE +/- 0.00, N = 321.13

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.8Benchmark: Gracefulfirst1122334455SE +/- 0.01, N = 348.51

OpenBenchmarking.orgSeconds, Fewer Is BetterMinion 1.8Benchmark: Solitairefirst20406080100SE +/- 0.61, N = 376.53

OpenBenchmarking.orgSeconds, Fewer Is BetterMinion 1.8Benchmark: Quasigroupfirst306090120150SE +/- 0.39, N = 3127

OpenBenchmarking.orgSeconds, Fewer Is BetterMinion 1.8Solitairefirst20406080100SE +/- 0.98, N = 376.48

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 Timefirst48121620SE +/- 0.01, N = 317.10

25 Results Shown

Timed HMMer Search
Timed MAFFT Alignment
Timed MrBayes Analysis
GNU GMP GMPbench
Fhourstones
BYTE Unix Benchmark:
  Dhrystone 2:
    LPS
    LPS
  Integer Arithmetic:
    LPS
  Register Arithmetic:
    LPS
  Floating-Point Arithmetic:
    LPS
SciMark:
  Composite
  Monte Carlo
  Fast Fourier Transform
  Sparse Matrix Multiply
  Dense LU Matrix Factorization
  Jacobi Successive Over-Relaxation
  Composite
Crafty
TSCP
dcraw
Minion:
  Graceful
  Solitaire
  Quasigroup
  Solitaire
Sudokut