Jetway

Intel Pentium G2030 testing with a American Megatrends 4.6.5 and Intel Gen7 on Ubuntu 21.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 2107154-SP-JETWAY74065
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
Jetway
July 15 2021
  2 Hours, 20 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):


JetwayOpenBenchmarking.orgPhoronix Test SuiteIntel Pentium G2030 @ 3.00GHz (2 Cores)American Megatrends 4.6.5Intel Xeon E3-1200 v2/3rd1 x 4 GB DDR3-1333MT/s Samsung M471B5173DB0-YK032GB SATA Flash + 1000GB Seagate ST1000NM0033-9ZMIntel Gen7 (1050MHz)Realtek ALC662 rev1SyncMasterIntel 82579LM + Intel 82574LUbuntu 21.045.11.0-22-generic (x86_64)GCC 10.3.0ext41280x1024ProcessorMotherboardChipsetMemoryDiskGraphicsAudioMonitorNetworkOSKernelCompilerFile-SystemScreen ResolutionJetway BenchmarksSystem Logs- --build=x86_64-linux-gnu --disable-vtable-verify --disable-werror --enable-bootstrap --enable-checking=release --enable-clocale=gnu --enable-default-pie --enable-gnu-unique-object --enable-languages=c,ada,c++,go,brig,d,fortran,objc,obj-c++,m2 --enable-libphobos-checking=release --enable-libstdcxx-debug --enable-libstdcxx-time=yes --enable-link-mutex --enable-multiarch --enable-multilib --enable-nls --enable-objc-gc=auto --enable-offload-targets=nvptx-none=/build/gcc-10-gDeRY6/gcc-10-10.3.0/debian/tmp-nvptx/usr,amdgcn-amdhsa=/build/gcc-10-gDeRY6/gcc-10-10.3.0/debian/tmp-gcn/usr,hsa --enable-plugin --enable-shared --enable-threads=posix --host=x86_64-linux-gnu --program-prefix=x86_64-linux-gnu- --target=x86_64-linux-gnu --with-abi=m64 --with-arch-32=i686 --with-build-config=bootstrap-lto-lean --with-default-libstdcxx-abi=new --with-gcc-major-version-only --with-multilib-list=m32,m64,mx32 --with-target-system-zlib=auto --with-tune=generic --without-cuda-driver -v - Scaling Governor: intel_cpufreq schedutil- KPTI + usercopy/swapgs barriers and __user pointer sanitization + Full generic retpoline IBPB: conditional IBRS_FW STIBP: disabled RSB filling + SSB disabled via prctl and seccomp + PTE Inversion; VMX: conditional cache flushes SMT disabled

Jetwaylczero: BLASmrbayes: Primate Phylogeny Analysishmmer: Pfam Database Searchmafft: Multiple Sequence Alignment - LSU RNAgmpbench: Total Timefhourstones: Complex Connect-4 Solvingbyte: Dhrystone 2scimark2: Compositecrafty: Elapsed Timetscp: AI Chess Performancestockfish: Total Timeasmfish: 1024 Hash Memory, 26 Depthdcraw: RAW To PPM Image Conversionm-queens: Time To Solveminion: Solitairen-queens: Elapsed Timesudokut: Total TimeJetway124295.60178.6724.112898.309398.3324695347.63432.0051134078233012568001322224766.67635.97109.89124.8619.90OpenBenchmarking.org

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.26Backend: BLASJetway306090120150SE +/- 0.33, N = 31241. (CXX) g++ options: -flto -pthread

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 AnalysisJetway60120180240300SE +/- 0.43, N = 3295.601. (CC) gcc options: -mmmx -msse -msse2 -msse3 -mssse3 -msse4.1 -msse4.2 -O3 -std=c99 -pedantic -lm

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 3.3.2Pfam Database SearchJetway4080120160200SE +/- 0.06, N = 3178.671. (CC) gcc options: -O3 -pthread -lhmmer -leasel -lm -lmpi

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.471Multiple Sequence Alignment - LSU RNAJetway612182430SE +/- 0.10, N = 324.111. (CC) gcc options: -std=c99 -O3 -lm -lpthread

GNU GMP GMPbench

GMPbench is a test of the GNU Multiple Precision Arithmetic (GMP) Library. GMPbench is a single-threaded integer benchmark that leverages the GMP library to stress the CPU with widening integer multiplication. Learn more via the OpenBenchmarking.org test page.

OpenBenchmarking.orgGMPbench Score, More Is BetterGNU GMP GMPbench 6.2.1Total TimeJetway60012001800240030002898.301. (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 SolvingJetway2K4K6K8K10KSE +/- 5.18, N = 39398.331. (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 2Jetway5M10M15M20M25MSE +/- 491.48, N = 324695347.63

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.0CompositeJetway90180270360450SE +/- 0.82, N = 3432.001. (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 TimeJetway1.1M2.2M3.3M4.4M5.5MSE +/- 2062.14, N = 351134071. (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 PerformanceJetway200K400K600K800K1000KSE +/- 1827.46, N = 58233011. (CC) gcc options: -O3 -march=native

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 TimeJetway500K1000K1500K2000K2500KSE +/- 12820.20, N = 325680011. (CXX) g++ options: -lgcov -m64 -lpthread -fno-exceptions -std=c++17 -fprofile-use -fno-peel-loops -fno-tracer -pedantic -O3 -msse -msse3 -mpopcnt -msse4.1 -mssse3 -msse2 -flto -flto=jobserver

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 DepthJetway700K1400K2100K2800K3500KSE +/- 4384.56, N = 33222247

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 ConversionJetway1530456075SE +/- 0.12, N = 366.671. (CC) gcc options: -lm

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 SolveJetway140280420560700SE +/- 0.01, N = 3635.971. (CXX) g++ options: -fopenmp -O2 -march=native

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.8SolitaireJetway20406080100SE +/- 1.53, N = 3109.891. (CXX) g++ options: -std=gnu++11 -O3 -fomit-frame-pointer -rdynamic

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 TimeJetway306090120150SE +/- 0.01, N = 3124.861. (CC) gcc options: -static -fopenmp -O3 -march=native

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 TimeJetway510152025SE +/- 0.01, N = 319.90