base

Intel Core i3 540 testing with a ASUS P7H55-M LX (0406 BIOS) and Intel Ironlake Desktop 2GB on Ubuntu 16.04 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 1812257-SK-BASE5695875
Jump To Table - Results

View

Do Not Show Noisy Results
Do Not Show Results With Incomplete Data
Do Not Show Results With Little Change/Spread
List Notable Results

Limit displaying results to tests within:

Bioinformatics 3 Tests
Chess Test Suite 2 Tests
C/C++ Compiler Tests 5 Tests
CPU Massive 6 Tests
HPC - High Performance Computing 3 Tests
MPI Benchmarks 2 Tests
Scientific Computing 3 Tests
Single-Threaded 6 Tests

Statistics

Show Overall Harmonic Mean(s)
Show Overall Geometric Mean
Show Geometric Means Per-Suite/Category
Show Wins / Losses Counts (Pie Chart)
Normalize Results
Remove Outliers Before Calculating Averages

Graph Settings

Force Line Graphs Where Applicable
Convert To Scalar Where Applicable
Prefer Vertical Bar Graphs

Multi-Way Comparison

Condense Multi-Option Tests Into Single Result Graphs

Table

Show Detailed System Result Table

Run Management

Highlight
Result
Hide
Result
Result
Identifier
Performance Per
Dollar
Date
Run
  Test
  Duration
Base
December 25 2018
  3 Minutes
base computational
December 25 2018
  3 Hours, 28 Minutes
Invert Hiding All Results Option
  1 Hour, 45 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):


baseOpenBenchmarking.orgPhoronix Test SuiteIntel Core i3 540 (2 Cores / 4 Threads)ASUS P7H55-M LX (0406 BIOS)Intel Core DRAM4096MB2 x 250GB Seagate ST3250318AS + 4GB Flash DiskIntel Ironlake Desktop 2GBVIA VT1708SAOC LM729Realtek RTL8111/8168/8411Ubuntu 16.044.4.0-139-generic (x86_64)Unity 7.4.5X Server 1.18.4intel 2.99.9172.1 Mesa 17.2.8GCC 5.4.0 20160609ext43200x1080ProcessorMotherboardChipsetMemoryDiskGraphicsAudioMonitorNetworkOSKernelDesktopDisplay ServerDisplay DriverOpenGLCompilerFile-SystemScreen ResolutionBase BenchmarksSystem Logs- --build=x86_64-linux-gnu --disable-browser-plugin --disable-vtable-verify --disable-werror --enable-checking=release --enable-clocale=gnu --enable-gnu-unique-object --enable-gtk-cairo --enable-java-awt=gtk --enable-java-home --enable-languages=c,ada,c++,java,go,d,fortran,objc,obj-c++ --enable-libmpx --enable-libstdcxx-debug --enable-libstdcxx-time=yes --enable-multiarch --enable-multilib --enable-nls --enable-objc-gc --enable-plugin --enable-shared --enable-threads=posix --host=x86_64-linux-gnu --target=x86_64-linux-gnu --with-abi=m64 --with-arch-32=i686 --with-arch-directory=amd64 --with-default-libstdcxx-abi=new --with-multilib-list=m32,m64,mx32 --with-tune=generic -v - KPTI + __user pointer sanitization + Full generic retpoline IBPB (Intel v4) IBRS_FW + SSB disabled via prctl and seccomp + PTE Inversion; VMX: conditional cache flushes SMT vulnerable

basecrafty: Elapsed Timetscp: AI Chess Performancehmmer: Pfam Database Searchmafft: Multiple Sequence Alignmentmrbayes: Primate Phylogeny Analysisfhourstones: 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: Compositenero2d: Total Timedcraw: RAW To PPM Image Conversionminion: Gracefulminion: Solitaireminion: Quasigroupminion: Solitairesudokut: Total TimeBasebase computational4846297618019484295461857330.2411.92954.157592.0014012850.3013554043.13111328.6477.7481.87333.22399.74750.62328.64428.4794.7586.92178.21195.75136.3328.89OpenBenchmarking.org

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 TimeBasebase computational1000K2000K3000K4000K5000KSE +/- 8622.90, N = 3SE +/- 8096.85, N = 348462974842954
OpenBenchmarking.orgNodes Per Second, More Is BetterCrafty 25.2Elapsed TimeBasebase computational800K1600K2400K3200K4000KMin: 4832254 / Avg: 4846297.33 / Max: 4861988Min: 4826760 / Avg: 4842953.67 / Max: 4851076

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 PerformanceBasebase computational130K260K390K520K650KSE +/- 259.46, N = 5SE +/- 169.99, N = 5618019618573
OpenBenchmarking.orgNodes Per Second, More Is BetterTSCP 1.81AI Chess PerformanceBasebase computational110K220K330K440K550KMin: 617464 / Avg: 618018.6 / Max: 618851Min: 618157 / Avg: 618573.4 / Max: 618851

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 Searchbase computational714212835SE +/- 0.75, N = 1130.24

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 Alignmentbase computational3691215SE +/- 0.22, N = 1211.92

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 Analysisbase computational2004006008001000SE +/- 3.42, N = 3954.15

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 Solvingbase computational16003200480064008000SE +/- 43.93, N = 37592.00

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 2base computational3M6M9M12M15MSE +/- 1105515.91, N = 614012850.30

OpenBenchmarking.orgLPS, More Is BetterBYTE Unix Benchmark 3.6Computational Test: Dhrystone 2base computational3M6M9M12M15MSE +/- 1527918.79, N = 913554043.13

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

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

OpenBenchmarking.orgLPS, More Is BetterBYTE Unix Benchmark 3.6Computational Test: Floating-Point Arithmeticbase computational0.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: Compositebase computational70140210280350SE +/- 0.16, N = 3328.64

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Monte Carlobase computational20406080100SE +/- 0.01, N = 377.74

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Fast Fourier Transformbase computational20406080100SE +/- 0.16, N = 381.87

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Sparse Matrix Multiplybase computational70140210280350SE +/- 0.08, N = 3333.22

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Dense LU Matrix Factorizationbase computational90180270360450SE +/- 0.07, N = 3399.74

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Computational Test: Jacobi Successive Over-Relaxationbase computational160320480640800SE +/- 0.63, N = 3750.62

OpenBenchmarking.orgMflops, More Is BetterSciMark 2.0Compositebase computational70140210280350SE +/- 0.16, N = 3328.64

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 Timebase computational90180270360450SE +/- 2.07, N = 3428.47

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 Conversionbase computational20406080100SE +/- 5.45, N = 1294.75

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: Gracefulbase computational20406080100SE +/- 0.01, N = 386.92

OpenBenchmarking.orgSeconds, Fewer Is BetterMinion 1.8Benchmark: Solitairebase computational4080120160200SE +/- 27.07, N = 6178.21

OpenBenchmarking.orgSeconds, Fewer Is BetterMinion 1.8Benchmark: Quasigroupbase computational4080120160200SE +/- 2.99, N = 5195.75

OpenBenchmarking.orgSeconds, Fewer Is BetterMinion 1.8Solitairebase computational306090120150SE +/- 0.27, N = 3136.33

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 Timebase computational714212835SE +/- 0.42, N = 528.89

25 Results Shown

Crafty
TSCP
Timed HMMer Search
Timed MAFFT Alignment
Timed MrBayes Analysis
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
Open FMM Nero2D
dcraw
Minion:
  Graceful
  Solitaire
  Quasigroup
  Solitaire
Sudokut