AESI2014

Intel Core i3 330M testing with a HP 1425 v54.12 and Intel Core IGP on Ubuntu 12.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 1404010-SO-AESI2014566
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
aesi
March 31 2014
 
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):


AESI2014OpenBenchmarking.orgPhoronix Test SuiteIntel Core i3 330M @ 2.13GHz (4 Cores)HP 1425 v54.12Intel Core DRAM4096MB320GB Western Digital WD3200BEKT-6Intel Core IGPRealtek ALC270BT156GW01Realtek RTL8101E/RTL8102E + Qualcomm Atheros AR9285 WirelessUbuntu 12.043.2.0-60-generic-pae (i686)Unity 5.20.0X Server 1.11.3intel 2.17.02.1 Mesa 8.0.4GCC 4.6ext41366x768ProcessorMotherboardChipsetMemoryDiskGraphicsAudioMonitorNetworkOSKernelDesktopDisplay ServerDisplay DriverOpenGLCompilerFile-SystemScreen ResolutionAESI2014 BenchmarksSystem Logs- Scaling Governor: acpi-cpufreq ondemand- Java SE Runtime Environment (build 1.7.0_51-b13).

AESI2014sudokut: Total Timesample-program: Phoronix Test Suite v4.8.6n-queens: Elapsed Timegnupg: 1GB File Encryptioncompress-pbzip2: 256MB File Compressionbuild-imagemagick: Time To Compilebork: File Encryption Timemrbayes: Primate Phylogeny Analysisaesi53.9022.95158.8128.5041.99198.6170.0347.95OpenBenchmarking.org

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 Timeaesi1224364860SE +/- 0.03, N = 353.90

Sample Pi Program

OpenBenchmarking.orgSeconds, Fewer Is BetterSample Pi ProgramPhoronix Test Suite v4.8.6aesi510152025SE +/- 0.01, N = 322.95

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 Timeaesi4080120160200SE +/- 0.09, N = 3158.811. (CC) gcc options: -static -fopenmp -O3

GnuPG

OpenBenchmarking.orgSeconds, Fewer Is BetterGnuPG 1.4.101GB File Encryptionaesi714212835SE +/- 0.05, N = 428.501. (CC) gcc options: -O2 -MT -MD -MP -MF

Parallel BZIP2 Compression

OpenBenchmarking.orgSeconds, Fewer Is BetterParallel BZIP2 Compression 1.1.6256MB File Compressionaesi1020304050SE +/- 0.15, N = 341.991. (CXX) g++ options: -O2 -pthread -lbz2 -lpthread

Timed ImageMagick Compilation

OpenBenchmarking.orgSeconds, Fewer Is BetterTimed ImageMagick Compilation 6.8.1-10Time To Compileaesi4080120160200SE +/- 0.12, N = 3198.61

Bork File Encrypter

OpenBenchmarking.orgSeconds, Fewer Is BetterBork File Encrypter 1.4File Encryption Timeaesi1632486480SE +/- 0.35, N = 370.03

Timed MrBayes Analysis

OpenBenchmarking.orgSeconds, Fewer Is BetterTimed MrBayes Analysis 3.1.2Primate Phylogeny Analysisaesi1122334455SE +/- 0.06, N = 347.95