README
1February 18, 2003
2-----------------
3Bug-fix release.
4
5December 9, 1997
6----------------
7This release is based on beta release 2 of BYTE Magazine's BYTEmark
8benchmark program (previously known as BYTE's Native Mode
9Benchmarks). This document covers the Native Mode (a.k.a. Algorithm
10Level) tests; benchmarks designed to expose the capabilities of a
11system's CPU, FPU, and memory system.
12
13Running a "make" will create the binary if all goes well. It is called
14"nbench" and performs a suite of 10 tests and compares the results to
15a Dell Pentium 90 with 16 MB RAM and 256 KB L2 cache running MSDOS and
16compiling with the Watcom 10.0 C/C++ compiler. If you define -DLINUX
17during compilation (the default) then you also get a comparison to an
18AMD K6/233 with 32 MB RAM and 512 KB L2-cache running Linux 2.0.32 and
19using a binary which was compiled with GNU gcc version 2.7.2.3 and GNU
20libc-5.4.38.
21
22For more verbose output specify -v as an argument.
23
24The primary web site is: http://www.tux.org/~mayer/linux/bmark.html
25
26The port to Linux/Unix was done by Uwe F. Mayer <mayer@tux.org>.
27
28The index-split was done by Andrew D. Balsa, and reflects the
29realization that memory management is important in CPU design. The
30original tests have been left alone, however, the tests NUMERIC SORT,
31FP EMULATION, IDEA, and HUFFMAN now constitute the integer-arithmetic
32focused benchmark index, while the tests STRING SORT, BITFIELD, and
33ASSIGNMENT make up the new memory index.
34
35The algorithms were not changed from the source which was obtained
36from the BYTE web site at http://www.byte.com/bmark/bmark.htm on
37December 14, 1996. However, the source was modified to better work
38with 64-bit machines (in particular the random number generator was
39modified to always work with 32 bit, no matter what kind of hardware
40you run it on). Furthermore, for some of the algorithms additional
41resettings of the data was added to increase the consistency across
42different hardware. Some extra debugging code was added, which has no
43impact on normal runs.
44
45In case there is uneven system load due to other processes while this
46benchmark suite executes, it might take longer to run than on an
47unloaded system. This is because the benchmark does some statistical
48analysis to make sure that the reported results are statistically
49significant, and an increased variation in individual runs requires
50more runs to achieve the required statistical confidence.
51
52This is a single-threaded benchmark and is not designed to measure the
53performance gain on multi-processor machines.
54
55For details and customization read bdoc.txt.
56
57THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
58IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
59OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
60IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
61INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
62NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
63DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
64THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
65(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
66THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
67
README.motorola
1The information in this file is old and no longer valid. It seems that
2the GNU C library has caught up with Motorola's libmoto, and now
3performance is just as good (or better) without libmoto. I'll include
4the old notice out of historical reasons only. Currently libmoto is
5available at ftp://ftp.mcg.mot.com/pub/SPS/PowerPC/software/mklinux/libmoto/,
6but this is subject to change and not under my control.
7
8February 18, 2003
9Uwe F. Mayer
10
11---------------------------------------------------------------------------
12
13If you have a Motorola CPU or equivalent:
14
15When linked with the 'libmoto' (floating point library from Motorola)
16the results you obtain are much better. (FPU index of 0.896 versus
171.910 in one example.)
18
19The Motorola math library is currently available at:
20http://www.mot.com/SPS/PowerPC/support/rsw_customer_support/mklinux/libmoto/libmoto_reg_mkdev.html
21
22If you have a Motorola CPU and you submit a result then please let me
23know whether you used libmoto or not. Please read the file README.submit.
24
25I do not have a Motorola CPU, and I can't help you with installing the
26library either.
27
28December 3, 1997
29Uwe F. Mayer
README.nonlinux
README.submit
1I plan on posting a digest of results in case people mail me any.
2The URL will be linked to
3
4http://www.tux.org/~mayer/linux/bmark.html
5
6If you want to submit, then run the benchmark (use your own
7compilation, I don't care with what flags or compiler, but I want all
8numbers from a single benchmark run) and fill in the template as given
9in the example below:
10
11CPU : AMD 5x86P75 (486DX4/133MHz)
12L2 CACHE : 256 KB
13OS : Linux 2.0.32
14C COMPILER : gcc 2.7.2.3
15LIBC : libc-5.4.38
16Pentium 90 INTEGER INDEX : 1.051
17Pentium 90 FLOATING-POINT INDEX : 0.450
18AMD K6/233 MEMORY INDEX : 0.337
19AMD K6/233 INTEGER INDEX : 0.238
20AMD K6/233 FLOATING-POINT INDEX : 0.230
21
22Any other format is fine as long as it contains the same info (write
23"unknown" or "?" for data you don't know). For example, you could just
24cut the summary from the output of nbench and mail it together with
25cache, CPU, and OS info in case it is not already present. Please do
26not email me the complete output of nbench, or any other unnecessarily
27long email, as this just eats up my hard-disk space. However, long
28collections of results are of course welcome.
29
30Send your result to mayer@tux.org
31
32Uwe F. Mayer
33February 18, 2003
34