pcbsdnqueens

Test de procesador que trata de colocar n reinas de ajedrez en un mismo tablero, sin que puedan comerse

Compare your own system(s) to this result file with the Phoronix Test Suite by running the command: phoronix-test-suite benchmark 1311203-SO-PCBSDNQUE74
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
Kubypcbsdnqueens
November 19 2013
 


pcbsdnqueensOpenBenchmarking.orgPhoronix Test SuiteAMD Athlon II P320 @ 2.10GHz (2 Cores)HPQOEM SLIC-MPC2816MBWestern Digital WD3200BEKT-60V5T1 12.01A12 + Generic- Multi-Card 1.00LLVMpipeATI (0x970f) HDAFreeBSD9.2-RELEASE-p9 (x86_64)Openbox 3.5.2X Server 1.12.4ati 6.14.62.1 Mesa 9.1.6 Gallium 0.4GCC 4.2.1 20070831 + Clang 3.3 (SVN 183502)zfs1366x768ProcessorMotherboardMemoryDiskGraphicsAudioOSKernelDesktopDisplay ServerDisplay DriverOpenGLCompilerFile-SystemScreen ResolutionPcbsdnqueens PerformanceSystem Logs

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 TimeKubypcbsdnqueens110220330440550SE +/- 9.24, N = 3486.09