Free benchmark software software for linux

Easy Benchmarking Suite is aimed at testing and benchmarking sites. Basically, the suite can:
- Issue requests to a URL. A benchmark typically consists of a given number of clients that concurrently issue a number of requests. A request can be any HTTP request (GET, POST, HEAD etc.) with all necessary HTTP header information (session cookies, basic authentication information, etc.);
- Get a quick overview of the results of a benchmark: how many trials succeeded, what are the average times for connecting and processing, what is the standard deviation of these times;
- Prepare a GnuPlot command file so that the obtained results can be plotted.
This document describes the suite. Furthermore, manual pages are provided for the separate parts of the suite: sitebench, sitecollect, and siteplot.

Objective of this project to provide benchmarking toolset for all available multiplatform C/C++ (and some Java) XML parsers.
Main features:
Currently following parsers are supported:
- LibXML2 + GDome + LibXSLT + XML Security
- Apache Xerces for C + Apache Xalan for C + Apacge XML Security for C
- IBM XML4C + IBM Lotus XSL
- Expat + CenterPoint XML + Sablotron + Arabica
- RXP Parser
- Oracle XDK for C/C++
- Oracle XDK for Java
- QT XML Module
- Sun Crismon + Java WebServices Developer Pack 1.2 + Apache XML Security
Following separate benchmarks provided:
- Non-Validating Parsing with Native,SAX,DOM Engines Benchmark
- Creating + Serializing DOM treee Benchmark
- Schema Validation Benchmark
- XSL Transformation Benchmark
- XML Security (Signature, Encryption) Benchmark
Following XML sources supported:
- Any valid XML file (with optional XSL, XSD companions)
- Auto-generated random simple XML file (variable size)
- Auto-generated random XML OPC-DA message sequence (variable size and length
Enhancements:
- Support Apache XML Security for C++, Version: CVS 08.02.2004
- Experemental support for XML Encryption Benchmark for Apache XML Security for C++ from CVS tree.
- Tested againist latest libraries

Billing Software project allows your business to track invoicing and allows your customers to view their invoices online and easily export them to Excel for saving or printing.
Invoices can also be emailed to customers right from the online application for convenience and efficiency.
Enhancements:
- This release fixes some minor bugs in the XML portions of the library files.

Contractor Software allows contractors to manage their projects and interact with customers online. A contractor can post each task of a project. Each task has a start date and estimated completion date.

The client can then always know where the project is and leave comments for the contractor on each task. The contractor can also reply to the client with a follow up comment. This enhances communication and also leaves a record for reference later.

Cache::Benchmark is a Perl module that tests the quality and speed of a cache module to compare cachemodules and algorithms.

SYNOPSIS

use Cache::Benchmark();
use Cache::MemoryCache();
use Cache::SizeAwareMemoryCache();

my $cache_1 = new Cache::MemoryCache({
namespace => my,
default_expires_in => 1,
});
my $cache_2 = new Cache::SizeAwareMemoryCache({
namespace => my,
default_expires_in => 1,
max_size => 400,
});

my $test = new Cache::Benchmark();
$test->init( access_counter => 10_000 );

$test->run($cache_1);
print $test->get_printable_result();

$test->run($cache_2);
print $test->get_printable_result();

The Bioinformatics Benchmark System is an attempt to build a reasonable testing framework, tests, and data, to enable end users and vendors to probe the performance of their systems.

What we are trying to do is to create a framework for testing, and a core set of tests that all may download and use to probe specific elements of systems performance.

Moreover, the source to these tests are available under GPL, and are hosted on Bioinformatics.org and Scalable Informatics LLC The idea is to enable end users, consumers, systems developers, and others to easily build and use meaningful tests for measurement and tuning reasons.

Joe Landman from Scalable Informatics LLC conceived the idea and wrote the original codes. We are looking for additional benchmark code suggestions, tests, data sets, etc.

Current baseline tests are several NCBI BLAST runs, several HMMer runs, and a variety of others. We plan to include ClustalW, X!Tandem, various chemistry, dynamics, and related tests, as well as several others.

Tests such as LINPACK or HPL simply do not provide meaningful performance indicators or predictive models for high performance informatics. Unfortunately, nor do a number of more recent and focused tests.

This is a problem as LINPACK and HPL specifically test the performance on various matrix operations, where you have effectively regular memory access patterns, and specific mathematical operations.

These codes are most useful for comparison to codes with heavy floating point operations, and interleaved memory traffic. These codes were not designed for comprehensive systems benchmarking, where disk I/O, memory latency, and other factors all contribute to the performance issues.

The best tests are the ones that are most similar to the codes you will run on the machine. The tests themselves should be reasonable approximations to a real execution of your code, using real data. You may need to pare it back in order to get realistic run times.

You should have a reasonable subset of data sizes. A single test does not tell you how your system scales, and one of the reasons for the existance of this test is specifically to allow you to test the performance while you increase various aspects of the workload.

You rarely get a quiescent system in a cluster, so we would recommend that you try to run in as realistic an operating environment as possible. A baseline in a quiescent system is fine, but it may set your expectations unreasonably.
top

Data::BenchmarkResults is a Perl extension for averaging and comparing multiple benchmark runs.

SYNOPSIS

use Data::BenchmarkResults;
$conditionA_results = new Data::BenchmarkResults;
$conditionB_results = new Data::BenchmarkResults;

#Load test result runs for the first condition
$conditionA_results->add_result_set("test1","run1",@data1);
$conditionA_results->add_result_set("test2","run1",@data2);
$conditionA_results->add_result_set("test1","run2",@data3);
$conditionA_results->add_result_set("test2","run2",@data4);

#Load test result runs for the second condition
$conditionB_results->add_result_set("test1","run1",@data5);
$conditionB_results->add_result_set("test2","run2",@data6);
$conditionB_results->add_result_set("test1","run1",@data7);
$conditionB_results->add_result_set("test2","run2",@data8);

#Average (mean average) the results of all the the runs of test1
# w/o tossing the highest and lowest values (replace the 0 with 1to
# toss the highest and lowest values

my $computed = $conditionA_results->process_result_set("test1","mean",0);
my $computed2 = $conditionB_results->process_result_set("test1","mean",0);

#OR process all of the tests at once (tossing the highest and lowest value) :

$conditionA_results->process_all_result_sets("mean",1);
$conditionB_results->process_all_result_sets("mean",1);


#Print out all of the processed test results
print "Condition A results.... nn"
$conditionA_results->print_calculated_sets;
print "Condition B results.... nn"
$conditionB_results->print_calculated_sets;


#Compare results of test1 of condition B against those with condition A
# as a percentage change from A to B

my $compared = $conditionB_results->compare_result_set($conditionA_results,"test1");

#OR compare all the processed test results from one condition to those of another
my $total_comparison = $conditionB_results->compare_all_result_sets($conditionA_results);