w10-pro-3vm1_ccta_bio-sci-fin-comp

w10-pro-3vm1_ccta_bio-sci-fin-comp

Compare your own system(s) to this result file with the Phoronix Test Suite by running the command: phoronix-test-suite benchmark 2111243-SP-W10PRO3VM96
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
View Logs
Performance Per
Dollar
Date
Run
  Test
  Duration
w10-pro-3vm1_ccta_bio-sci-fin-comp
November 24 2021
  1 Hour, 1 Minute
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):


w10-pro-3vm1_ccta_bio-sci-fin-compOpenBenchmarking.orgPhoronix Test SuiteAMD Ryzen Threadripper 3960X 24-Core @ 3.80GHz (8 Cores)Intel 440BX1 x 16384 MB 0MHz VMW-16384MB512GB VMware Virtual SVMware SVGA 3DIntel 82574L Gigabit Connection #6 + TAP-Windows V9 + Intel 82574L Gigabit Connection + Intel 82574L Gigabit Connection #2Microsoft Windows 11 Pro Build 2200010.0 (x86_64)8.17.3.1GCC 7.1.0NTFS2558x1343VMwareProcessorMotherboardMemoryDiskGraphicsNetworkOSKernelDisplay DriverCompilerFile-SystemScreen ResolutionSystem LayerW10-pro-3vm1_ccta_bio-sci-fin-comp BenchmarksSystem Logs

w10-pro-3vm1_ccta_bio-sci-fin-compfhourstones: Complex Connect-4 Solvingffte: N=256, 1D Complex FFT Routinescimark2: Compositelczero: BLAScrafty: Elapsed Timetscp: AI Chess Performancestockfish: Total Timeasmfish: 1024 Hash Memory, 26 Depthnamd: ATPase Simulation - 327,506 Atomsmrbayes: Primate Phylogeny Analysism-queens: Time To Solveminion: Solitairen-queens: Elapsed Timesudokut: Total Timew10-pro-3vm1_ccta_bio-sci-fin-comp11157.8037494.15540.1429716756462103238713481638149171162.56968703.04124.2660.3726.514.03OpenBenchmarking.org

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 Solvingw10-pro-3vm1_ccta_bio-sci-fin-comp2K4K6K8K10KSE +/- 23.70, N = 211157.80

FFTE

FFTE is a package by Daisuke Takahashi to compute Discrete Fourier Transforms of 1-, 2- and 3- dimensional sequences of length (2^p)*(3^q)*(5^r). Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgMFLOPS, More Is BetterFFTE 7.0Test: N=256, 1D Complex FFT Routinew10-pro-3vm1_ccta_bio-sci-fin-comp8K16K24K32K40KSE +/- 631.89, N = 237494.15

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.0Compositew10-pro-3vm1_ccta_bio-sci-fin-comp120240360480600SE +/- 0.11, N = 2540.14

LeelaChessZero

LeelaChessZero (lc0 / lczero) is a chess engine automated vian neural networks. This test profile can be used for OpenCL, CUDA + cuDNN, and BLAS (CPU-based) benchmarking. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgNodes Per Second, More Is BetterLeelaChessZero 0.28Backend: BLASw10-pro-3vm1_ccta_bio-sci-fin-comp6001200180024003000SE +/- 22.00, N = 22971

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 Timew10-pro-3vm1_ccta_bio-sci-fin-comp1.4M2.8M4.2M5.6M7MSE +/- 21897.00, N = 26756462

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 Performancew10-pro-3vm1_ccta_bio-sci-fin-comp200K400K600K800K1000KSE +/- 967.50, N = 21032387

Stockfish

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

OpenBenchmarking.orgNodes Per Second, More Is BetterStockfish 13Total Timew10-pro-3vm1_ccta_bio-sci-fin-comp3M6M9M12M15MSE +/- 9852.00, N = 213481638

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 Depthw10-pro-3vm1_ccta_bio-sci-fin-comp3M6M9M12M15MSE +/- 206271.00, N = 214917116

NAMD

NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD was developed by the Theoretical and Computational Biophysics Group in the Beckman Institute for Advanced Science and Technology at the University of Illinois at Urbana-Champaign. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgdays/ns, Fewer Is BetterNAMD 2.14ATPase Simulation - 327,506 Atomsw10-pro-3vm1_ccta_bio-sci-fin-comp0.57821.15641.73462.31282.891SE +/- 0.00382, N = 22.56968

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.2.7Primate Phylogeny Analysisw10-pro-3vm1_ccta_bio-sci-fin-comp150300450600750SE +/- 0.99, N = 2703.04

m-queens

A solver for the N-queens problem with multi-threading support via the OpenMP library. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is Betterm-queens 1.2Time To Solvew10-pro-3vm1_ccta_bio-sci-fin-comp306090120150SE +/- 0.26, N = 2124.26

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.8Solitairew10-pro-3vm1_ccta_bio-sci-fin-comp1428425670SE +/- 0.53, N = 260.37

N-Queens

This is a test of the OpenMP version of a test that solves the N-queens problem. The board problem size is 18. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgSeconds, Fewer Is BetterN-Queens 1.0Elapsed Timew10-pro-3vm1_ccta_bio-sci-fin-comp612182430SE +/- 0.02, N = 226.51

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 Timew10-pro-3vm1_ccta_bio-sci-fin-comp0.90681.81362.72043.62724.534SE +/- 0.28, N = 24.03