Free benchmark suite software for linux

Zimbra Collaboration Suite project is a client/server technology for enterprise messaging and collaboration.
Zimbra delivers innovation for both the administrator and the end-user as well as compatibility with existing infrastructure and applications (both open source and proprietary).
The Zimbra Collaboration Suite provides support for email, contacts, and group calendaring, and consists of a server and client.
Main features:
Administrator Benefits
- Online move, backup and recovery of individual or a group of mailboxes
- Compatibility with Active Directory and existing LDAP directories
- Native hierarchical storage management and clustering
- Web services integration with existing enterprise applications
- Integrated anti-spam and anti-virus
End-User Benefits
- Browser based client with search, shared calendar and mail that is integrated with contacts and calendar
- Support for Outlook: calendar, mail, contacts and offline mode
- Support for mobile devices: Blackberry, Treo and etc
- Support of Windows, Apple and Linux computer.
Whats New in 5.0.0 Beta 1 Development Release:
- This is the first release in the 5.0.0 release cycle.
- New features include IM, Tasks, Standard Client autocompletion, and keyboard navigation.
- Updates have been made to migration wizards and apple/outlook connectors.
Whats New in 4.5.6 Stable Release:
- Support for an automated MySQL database corruption check that will send a notification to the admin.
- Spam training has been enhanced by allowing programmatic scanning of folders without requiring a password.
- Admins can get backup and restore complete notifications sent via email.
- .Doc and .pdf files open correctly in Zimbra Web Client.
- iSync will not duplicate the calendar, and iSync Connector works correctly with Mac OS X 10.4.10.
- Servers automatically start after a ZCS upgrade.
- Web-based cross-mailbox discovery is available for the optional Zimbra Archiving and Discovery module.

The Zaval Proxy Suite is an easy-to-use solution that allows monitoring TCP-based protocols, such as HTTP, NNTP and others. It is extremely useful in software development and can be used as a debug tool. Another area of appliance is multiple connections logging with proxy facilities. As soon as its a pure java solution it can be used almost everywhere.

The Zaval Proxy functions as a proxy and transfers data between the server and the client writing incoming and outgoing traffic into log files. So you can see these raw data as is.

On start the Zaval Proxy Suite goes through configuration file and creates the specified number of proxy servers and the shutdown server.

"Proxy server" is a server socket listening on the specified port. When the client is connected proxy connects to the target server and transfers data between them logging entire traffic. On each connection 2 files are created - xxx-input (request data from the client) and xxx-output (response data from the server). The "xxx" means here the sequential number of the connection for the proxy server. The traffic is logged into the separate directory for each proxy.

Shutdown server is needed to close all open connections correctly and close the program.

So, in the particular case you should specify address of proxy server in client application (web browser, for example) and address of the target server in the proxy configuration file. You can create any number of proxy servers that run at the same time, however, they should use different port numbers.

PHPBench provides a benchmark suite for PHP.
It performs a large number of simple tests in order to bench various
aspects of the PHP interpreter.
PHPBench can be used to compare hardware, operating systems, PHP versions, PHP accelerators and caches, compiler options, etc.
Custom tests can be easily added to the suite.
In order to get accurate results, every test is evaluated more than once.
By defaut, tests are evaluated 100000 times, or multiples of that value for
some tests that are known to be CPU-expensive or other tests that are known to be very fast.
If you have slow hardware or very fast hardware, you can change the number
of iterations, with the -i switch:
./phpbench.php -i 5000
he score you get when the benchmark completes is a ratio between the number of iterations and the total time that was needed to perform all tests.
Thus, the score should be independant of the number of iterations, but the higher number you use, the more accuracy you will get.
Enhancements:
- The regression test of test_bitwise has been fixed for 64-bits CPUs.

The benchmark program takes less than 10 minutes to run (on most machines) and compares the system it is run on to two benchmark systems (a Dell Pentium 90 with 256 KB cache running MSDOS and an AMD K6/233 with 512 KB cache running Linux).

The archive contains the complete source, documentation, and a binary (Linux elf). The source has been successfully compiled on various operating systems, including SunOS, DEC Unix 4.0, DEC OSF1, HP-UX, DEC Ultrix, MS-DOS, and of course Linux.

This release is based on the Unix port of beta release 2 of BYTE Magazines BYTEmark benchmark program (previously known as BYTEs Native Mode Benchmarks). The port to Linux/Unix was done by Uwe F. Mayer.

Additional changes to the code were made to make the code work with egcs compiler and to make the software packagable. This is a CPU benchmark providing indexes for integer, floating, and memory performance. It is single-threaded and is not designed to measure the performance gain on multi-processor machines.

Running a "make" will create the binary if all goes well. It is called "nbench" and performs a suite of 10 tests and compares the results to a Dell Pentium 90 with 16 MB RAM and 256 KB L2 cache running MSDOS and compiling with the Watcom 10.0 C/C++ compiler.

If you define -DLINUX during compilation (the default) then you also get a comparison to an AMD K6/233 with 32 MB RAM and 512 KB L2-cache running Linux 2.0.32 and using a binary which was compiled with GNU gcc version 2.7.2.3 and GNU libc-5.4.38.

The algorithms were not changed from the source which was obtained from the BYTE web site at http://www.byte.com/bmark/bmark.htm on December 14, 1996. However, the source was modified to better work with 64-bit machines (in particular the random number generator was modified to always work with 32 bit, no matter what kind of hardware you run it on).

Furthermore, for some of the algorithms additional resettings of the data was added to increase the consistency across different hardware. Some extra debugging code was added, which has no impact on normal runs.

In case there is uneven system load due to other processes while this benchmark suite executes, it might take longer to run than on an unloaded system.

This is because the benchmark does some statistical analysis to make sure that the reported results are statistically significant, and an increased variation in individual runs requires more runs to achieve the required statistical confidence.

This is a single-threaded benchmark and is not designed to measure the performance gain on multi-processor machines.

HPC Challenge is a high performance benchmark suite. The HPC Challenge consists of basically 7 benchmarks:
1. HPL - the Linpack TPP benchmark which measures the floating point rate of execution for solving a linear system of equations.
2. DGEMM - measures the floating point rate of execution of double precision real matrix-matrix multiplication.
3. STREAM - a simple synthetic benchmark program that measures sustainable memory bandwidth (in GB/s) and the corresponding computation rate for simple vector kernel.
4. PTRANS (parallel matrix transpose) - exercises the communications where pairs of processors communicate with each other simultaneously. It is a useful test of the total communications capacity of the network.
5. RandomAccess - measures the rate of integer random updates of memory (GUPS).
6. FFTE - measures the floating point rate of execution of double precision complex one-dimensional Discrete Fourier Transform (DFT).
7. Communication bandwidth and latency - a set of tests to measure latency and bandwidth of a number of simultaneous communication patterns; based on b_eff (effective bandwidth benchmark).
Compiling:
The first step is to create a configuration file that reflects characteristics of your machine. The configuration file should be created in the hpl directory. This directory contains instructions (the files README and INSTALL) on how to create the configuration file. The directory hpl/setup contains many examples of configuration files. A good approach is to copy one of them to the hpl directory and if it doesnt work then change it. This file is reused by all the components of the HPC Challange suite.
When configuration is done, a file should exist in the hpl directory whose name starts with Make. and ends with the name for the system used for tests. For example, if the name of the system is Unix, the file should be named Make.Unix.
To build the benchmark executable (for the system named Unix) type: make arch=Unix. This command should be run in the top directory (not in the hpl directory). It will look in the hpl directory for the configuration file and use it to build the benchmark executable.
Configuration:
The HPC Challange is driven by a short input file named hpccinf.txt that is almost the same as the input file for HPL (customarily called HPL.dat). Refer to the file hpl/www/tuning.html for details about the input file for HPL. A sample input file is included with the HPC Challange distribution.
The differences between HPL input file and HPC Challange input file can be summarized as follows:
- Lines 3 and 4 are ignored. The output always goes to the file named hpccoutf.txt.
- There are additional lines (starting with line 33) that may (but do not have to) be used to customize the HPC Challenge benchmark. They are described below.
The additional lines in the HPC Challenge input file (compared to the HPL input file) are:
Lines 33 and 34 describe additional matrix sizes to be used for running the PTRANS benchmark (one of the components of the HPC Challange benchmark).
- Lines 35 and 36 describe additional blocking factors to be used for running PTRANS benchmark.
Just for completeness, here is the list of lines of the HPC Challanges input file with brief descriptions of their meaning:
- Line 1: ignored
- Line 2: ignored
- Line 3: ignored
- Line 4: ignored
- Line 5: number of matrix sizes for HPL (and PTRANS)
- Line 6: matrix sizes for HPL (and PTRANS)
- Line 7: number of blocking factors for HPL (and PTRANS)
- Line 8: blocking factors for HPL (and PTRANS)
- Line 9: type of process ordering for HPL
- Line 10: number of process grids for HPL (and PTRANS)
- Line 11: numbers of process rows of each process grid for HPL (and
PTRANS)
- Line 12: numbers of process columns of each process grid for HPL
(and PTRANS)
- Line 13: threshold value not to be exceeded by scaled residual for
HPL (and PTRANS)
- Line 14: number of panel factorization methods for HPL
- Line 15: panel factorization methods for HPL
- Line 16: number of recursive stopping criteria for HPL
- Line 17: recursive stopping criteria for HPL
- Line 18: number of recursion panel counts for HPL
- Line 19: recursion panel counts for HPL
- Line 20: number of recursive panel factorization methods for HPL
- Line 21: recursive panel factorization methods for HPL
- Line 22: number of broadcast methods for HPL
- Line 23: broadcast methods for HPL
- Line 24: number of look-ahead depths for HPL
- Line 25: look-ahead depths for HPL
- Line 26: swap methods for HPL
- Line 27: swapping threshold for HPL
- Line 28: form of L1 for HPL
- Line 29: form of U for HPL
- Line 30: value that specifies whether equilibration should be used
by HPL
- Line 31: memory alignment for HPL
- Line 32: ignored
- Line 33: number of additional problem sizes for PTRANS
- Line 34: additional problem sizes for PTRANS
- Line 35: number of additional blocking factors for PTRANS
- Line 36: additional blocking factors for PTRANS
Enhancements:
- This version contains many bugfixes, major features, and minor enhancements, many of which were contributed by users.
- The major focus of this release was to improve accuracy of the reported performance results and ensure scalability of the code on the largest supercomputer installations with hundreds of thousands of computational cores.

Benchmark::Forking is a Perl module to run benchmarks in separate processes.

SYNOPSIS

use Benchmark::Forking qw( timethis timethese cmpthese );

timethis ($count, "code");

timethese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});

cmpthese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});

Benchmark::Forking->enabled(0); # Stop using forking feature
...
Benchmark::Forking->enabled(1); # Begin using forking again

The Benchmark::Forking module changes the behavior of the standard Benchmark module, running each piece of code to be timed in a separate forked process. Because each child exits after running its timing loop, the computations it performs cant propogate back to affect subsequent test cases.

This can make benchmark comparisons more accurate, because the separate test cases are mostly isolated from side-effects caused by the others. Benchmark scripts typically dont depend on those side-effects, so in most cases you can simply use or require this module at the top of your existing code without having to change anything else. (A few key exceptions are noted in "BUGS".)