pc benchmark
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 503
Benchmark 5.8.8
Benchmark is a Perl module with benchmark running times of Perl code. more>>
Benchmark is a Perl module with benchmark running times of Perl code.
SYNOPSIS
use Benchmark qw(:all) ;
timethis ($count, "code");
# Use Perl code in strings...
timethese($count, {
Name1 => ...code1...,
Name2 => ...code2...,
});
# ... or use subroutine references.
timethese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
# cmpthese can be used both ways as well
cmpthese($count, {
Name1 => ...code1...,
Name2 => ...code2...,
});
cmpthese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
# ...or in two stages
$results = timethese($count,
{
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
},
none
);
cmpthese( $results ) ;
$t = timeit($count, ...other code...)
print "$count loops of other code took:",timestr($t),"n";
$t = countit($time, ...other code...)
$count = $t->iters ;
print "$count loops of other code took:",timestr($t),"n";
# enable hires wallclock timing if possible
use Benchmark :hireswallclock;
The Benchmark module encapsulates a number of routines to help you figure out how long it takes to execute some code.
timethis - run a chunk of code several times
timethese - run several chunks of code several times
cmpthese - print results of timethese as a comparison chart
timeit - run a chunk of code and see how long it goes
countit - see how many times a chunk of code runs in a given time
<<lessSYNOPSIS
use Benchmark qw(:all) ;
timethis ($count, "code");
# Use Perl code in strings...
timethese($count, {
Name1 => ...code1...,
Name2 => ...code2...,
});
# ... or use subroutine references.
timethese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
# cmpthese can be used both ways as well
cmpthese($count, {
Name1 => ...code1...,
Name2 => ...code2...,
});
cmpthese($count, {
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
});
# ...or in two stages
$results = timethese($count,
{
Name1 => sub { ...code1... },
Name2 => sub { ...code2... },
},
none
);
cmpthese( $results ) ;
$t = timeit($count, ...other code...)
print "$count loops of other code took:",timestr($t),"n";
$t = countit($time, ...other code...)
$count = $t->iters ;
print "$count loops of other code took:",timestr($t),"n";
# enable hires wallclock timing if possible
use Benchmark :hireswallclock;
The Benchmark module encapsulates a number of routines to help you figure out how long it takes to execute some code.
timethis - run a chunk of code several times
timethese - run several chunks of code several times
cmpthese - print results of timethese as a comparison chart
timeit - run a chunk of code and see how long it goes
countit - see how many times a chunk of code runs in a given time
Download (12.2MB)
Added: 2007-05-15 License: Perl Artistic License Price:
1240 downloads
XML Benchmark 1.3.0
XML Benchmark is a C/C++/Java XML parsers benchmarking tool set. more>>
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
<<lessMain 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
Download (0.88MB)
Added: 2005-04-12 License: GPL (GNU General Public License) Price:
1656 downloads
CompBenchmarks 0.4.0
CompBenchmarks is a benchmarking environment for compilers. more>>
CompBenchmarks project is a benchmarking environment for compilers:
- It provides a package for downloading and easing usage of some well-known C/C++ benchmarks,
- The package allows you to specify compilation options and compilers to use, giving results in a common format,
- This web-site provides a convenient browsing formular to analyse imported benchmarks.
For now, Ive concentrated my efforts on benchmarking of GCC and espacially on its embedded C and C++ compilers on the Linux/x86 platform, yet support for others languages, compilers or platforms can be added (Cygwin is supported).
Enhancements:
- 25 more benchmarks are supported (C++ language).
- There is an improved build mechanism, and a useless (nonexistent) script call has been removed.
- The Web site has reached 10,000 published results.
<<less- It provides a package for downloading and easing usage of some well-known C/C++ benchmarks,
- The package allows you to specify compilation options and compilers to use, giving results in a common format,
- This web-site provides a convenient browsing formular to analyse imported benchmarks.
For now, Ive concentrated my efforts on benchmarking of GCC and espacially on its embedded C and C++ compilers on the Linux/x86 platform, yet support for others languages, compilers or platforms can be added (Cygwin is supported).
Enhancements:
- 25 more benchmarks are supported (C++ language).
- There is an improved build mechanism, and a useless (nonexistent) script call has been removed.
- The Web site has reached 10,000 published results.
Download (0.065MB)
Added: 2006-12-23 License: GPL (GNU General Public License) Price:
1036 downloads
Cache::Benchmark 0.011
Cache::Benchmark is a Perl module that tests the quality and speed of a cache module to compare cachemodules and algorithms. more>>
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();
<<lessSYNOPSIS
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();
Download (0.008MB)
Added: 2007-05-28 License: Perl Artistic License Price:
881 downloads
Apache Hello World Benchmarks 1.04
Apache Hello World Benchmarks is a tool that generates benchmarks of Apache Web frameworks. more>>
Apache Hello World Benchmarks is a benchmarking tool that seeks to give a sense of Web application execution speed on various software platforms running under the Apache Web server.
Benchmarks can vary greatly from system to system, so this tool allows one to get numbers on ones own platform. Applications tested include mod_perl, mod_php, Tomcat, and Apache::ASP, with over 62 benchmarks in all.
Benchmark Descriptions:
Hello World 2000 ( 2000 )
The 2000 benchmark tries to emulate a heavy web page template. It is typically 3K+ in program length that results in output of over 20K. While this does not properly reflect any web applications speed of back end business logic execution, it does show a template heavy request with some application logic and loops, some HTTP parameter passing, and much variable interpolation in the output stream.
Hello World ( hello )
The Hello World benchmark merely prints "Hello World" and as such is a good test for the fastest a web page could ever run under the given web application environment. For historical reasons, the benchmarks are written to print "Hello" and then add to the output World as a raw string.
HelloDB ( hellodb )
The HelloDB benchmark merely queries the database for the string "Hello World", and as such represents the fastest a web application can process a request when talking to a database. This is a new benchmark with only MySQL supported for now, but more environments and databases will be added over time.
XSLT Big ( xsltbig )
This benchmark hits an XSLT rendering engine hard with 18K+ XML being transformed with a 1K+ XSL stylesheet for over 20K output. Though XSLT is generally slow, many applications will use XSLT caching to speed up response times. This benchmark should emulate well a real world XSLT usage scenario, with perhaps the XSL itself being too trivial.
Hello XSLT ( xslt )
Like the Hello World benchmark, the XSLT version just outputs "Hello World", or the closest we can get when doing XSLT, so it too demonstrates the fastest an application can render a page with XSLT. Benchmarks should be similarly configured between xsltbig and xslt, so a slow caching layer that benefits the former might slow down this benchmark.
<<lessBenchmarks can vary greatly from system to system, so this tool allows one to get numbers on ones own platform. Applications tested include mod_perl, mod_php, Tomcat, and Apache::ASP, with over 62 benchmarks in all.
Benchmark Descriptions:
Hello World 2000 ( 2000 )
The 2000 benchmark tries to emulate a heavy web page template. It is typically 3K+ in program length that results in output of over 20K. While this does not properly reflect any web applications speed of back end business logic execution, it does show a template heavy request with some application logic and loops, some HTTP parameter passing, and much variable interpolation in the output stream.
Hello World ( hello )
The Hello World benchmark merely prints "Hello World" and as such is a good test for the fastest a web page could ever run under the given web application environment. For historical reasons, the benchmarks are written to print "Hello" and then add to the output World as a raw string.
HelloDB ( hellodb )
The HelloDB benchmark merely queries the database for the string "Hello World", and as such represents the fastest a web application can process a request when talking to a database. This is a new benchmark with only MySQL supported for now, but more environments and databases will be added over time.
XSLT Big ( xsltbig )
This benchmark hits an XSLT rendering engine hard with 18K+ XML being transformed with a 1K+ XSL stylesheet for over 20K output. Though XSLT is generally slow, many applications will use XSLT caching to speed up response times. This benchmark should emulate well a real world XSLT usage scenario, with perhaps the XSL itself being too trivial.
Hello XSLT ( xslt )
Like the Hello World benchmark, the XSLT version just outputs "Hello World", or the closest we can get when doing XSLT, so it too demonstrates the fastest an application can render a page with XSLT. Benchmarks should be similarly configured between xsltbig and xslt, so a slow caching layer that benefits the former might slow down this benchmark.
Download (0.037MB)
Added: 2005-04-12 License: Perl Artistic License Price:
1657 downloads
Open CORBA Benchmarking Suite 1.17
Open CORBA Benchmarking Suite is a benchmarking suite for CORBA brokers. more>>
The Open CORBA Benchmarking Suite measures several basic performance aspects of various CORBA brokers.
The suite produces an XML output that can be submitted to a searchable database of broker performance data and browsed in a graphical form. The suite is portable to a number of platforms and brokers.
For C++ brokers
Enter the "C++" directory. Then enter the subdirectory of that directory that corresponds to the broker of your choice. Check the README file there for further instructions, usually you will use "make" to compile the benchmark.
For Java brokers
Enter the "Java" and then the "build" directory. Then enter the subdirectory of that directory that corresponds to the broker of your choice. Check the README file there for further instructions, usually you will use "ant" to compile the benchmark "ant run" to execute the benchmark.
Understanding results
The results do not get printed until the benchmark is finished, which can take from 2 to 4 hours depending on the platform. The best way to view the results is to capture them to a file and view them graphically at http://nenya.ms.mff.cuni.cz/~bench.
Enhancements:
- Support for system information on Linux 2.6 kernels.
- Slight extensions to the documentation.
- Support for some recent brokers on Solaris (VisiBroker 6.0, omniORB 4.0.5, JacORB 2.2.1).
- Support for some recent brokers on Linux (omniORB 4.0.5, JacORB 2.2.1, JDK 1.5.0, TAO 1.4.3).
<<lessThe suite produces an XML output that can be submitted to a searchable database of broker performance data and browsed in a graphical form. The suite is portable to a number of platforms and brokers.
For C++ brokers
Enter the "C++" directory. Then enter the subdirectory of that directory that corresponds to the broker of your choice. Check the README file there for further instructions, usually you will use "make" to compile the benchmark.
For Java brokers
Enter the "Java" and then the "build" directory. Then enter the subdirectory of that directory that corresponds to the broker of your choice. Check the README file there for further instructions, usually you will use "ant" to compile the benchmark "ant run" to execute the benchmark.
Understanding results
The results do not get printed until the benchmark is finished, which can take from 2 to 4 hours depending on the platform. The best way to view the results is to capture them to a file and view them graphically at http://nenya.ms.mff.cuni.cz/~bench.
Enhancements:
- Support for system information on Linux 2.6 kernels.
- Slight extensions to the documentation.
- Support for some recent brokers on Solaris (VisiBroker 6.0, omniORB 4.0.5, JacORB 2.2.1).
- Support for some recent brokers on Linux (omniORB 4.0.5, JacORB 2.2.1, JDK 1.5.0, TAO 1.4.3).
Download (0.14MB)
Added: 2005-04-12 License: Freely Distributable Price:
1656 downloads
Benchmark::Forking 0.99
Benchmark::Forking is a Perl module to run benchmarks in separate processes. more>>
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".)
<<lessSYNOPSIS
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".)
Download (0.006MB)
Added: 2007-04-30 License: Perl Artistic License Price:
907 downloads
Easy Benchmarking Suite 1.05
Easy Benchmarking Suite is aimed at testing and benchmarking sites. more>>
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.
<<less- 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.
Download (0.14MB)
Added: 2006-03-21 License: Other/Proprietary License Price:
1314 downloads
Bioinformatics Benchmark System 3
Bioinformatics Benchmark System is a bioinformatics benchmark system for platform performance measurement. more>>
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
<<lessWhat 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
Download (5.0MB)
Added: 2005-08-12 License: GPL (GNU General Public License) Price:
1533 downloads
ProcBench 0.7.1 Alpha
Procbench is a multiplatform information tool and CPU benchmark for x86 processors. more>>
Procbench is a multiplatform information tool and CPU benchmark for x86 processors. This application tests memory transfer and math capabilities of your x86 processor.
Main features:
- Identification of CPU by CPUID.
- Approximation of CPU MHz.
- Benchmarks.
Installation:
type:
make install
try:
./procbench -h
for information
Enhancements:
- DB of CPUs added.
<<lessMain features:
- Identification of CPU by CPUID.
- Approximation of CPU MHz.
- Benchmarks.
Installation:
type:
make install
try:
./procbench -h
for information
Enhancements:
- DB of CPUs added.
Download (0.048MB)
Added: 2007-07-13 License: GPL (GNU General Public License) Price:
836 downloads
pipebench 0.40
pipebench is a utility that shows the status and a benchmark of piped commands. more>>
Pipebench shows the current throughput and amount of data going through a pipe. It can be used to show the progress of a large md5sum process: cat bigfile | pipebench | md5sum.
Pipebench measures the speed of a pipe, by sitting in the middle passing the data along to the next process. Works on at least Linux, OpenBSD, NetBSD, Solaris and x86, Alpha, HPPA, Sparc and Sparc64.
Compiling
Just type make to compile.
Type make install to have pipebench be installed in /usr/local/bin
<<lessPipebench measures the speed of a pipe, by sitting in the middle passing the data along to the next process. Works on at least Linux, OpenBSD, NetBSD, Solaris and x86, Alpha, HPPA, Sparc and Sparc64.
Compiling
Just type make to compile.
Type make install to have pipebench be installed in /usr/local/bin
Download (0.011MB)
Added: 2005-04-12 License: GPL (GNU General Public License) Price:
1656 downloads
PHPBench 0.8.1
PHPBench provides a benchmark suite for PHP. more>>
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.
<<lessIt 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.
Download (0.009MB)
Added: 2007-04-30 License: Freely Distributable Price:
575 downloads
Data::BenchmarkResults 0.01
Data::BenchmarkResults is a Perl extension for averaging and comparing multiple benchmark runs. more>>
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);
<<lessSYNOPSIS
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);
Download (0.009MB)
Added: 2007-08-16 License: Perl Artistic License Price:
799 downloads
dkftpbench 0.45
dkftpbench is an FTP benchmark program inspired by SPECweb99. more>>
dkftpbench application is an FTP benchmark program inspired by SPECweb99. The result of the benchmark is a number-of-simultaneous-users rating; after running the benchmark properly, you have a good idea how many simultaneous dialup clients a server can support. The target bandwidth per client is set at 28.8 kilobits/second to model dialup users; this is important for servers on the real Internet, which often serve thousands of clients on only 10 MBits/sec of bandwidth.
The final result of the benchmark is "the number of simultaneous 28.8 kilobits/second dialup users". To estimate this number, the benchmark starts up a new simulated user as soon as the last one has finished connecting. It stops increasing the number of users when one fails to connect, fails to maintain the desired bandwidth, or the limit specified by the -n option is reached. It runs the simulated users until the amount of time specified by the -t option has elapsed since the last simulated user birth or death; the final score is the number of users still alive at the end.
Main features:
- Compiles and runs on Linux, FreeBSD, and Solaris (or did, last I tried)
- fetches many files in parallel
- waits for each connect to finish (and then a bit) before starting next one; slows down to < 1 connect/second when it reaches 75% of desired number of users. This spreads out user activity more evenly.
- checks bandwidth continuously during each file fetch, stops adding users if any fetch too slow
- throttles each fetch to use only the specified bandwidth
- search for the max number of supported users
- Displays verbose error message when any user fails
- Aborts if it detects the client system running out of resources
- Aborts if connecting to the server takes > 5 seconds
- Aborts if it takes longer than 5 seconds to get first packet of a file
- Uses new Poller class for scalability; you can specify which Poller to use on the commandline
- Supports slow datarates (before, it only handles rates above 80kbits/sec on some systems)
- Lets you set how picky it is about datarates (before, its must be faster than threshold was fixed at 3/4 the target bandwidth)
- Supports alternative readiness notification methods like O_ASYNC and O_ONESIGFD
- Provided both as a standalone executable, and as a Corba object. (Thanks to http://corbaconf.kiev.ua/ for the Corba autoconf macros.
- Switches to BINARY mode after login. (The client API lets you choose; edit robouser.cc to skip the START_TYPE state if you want to use ASCII.)
Example:
After unpacking the sources, configure them for your system with the command
./configure
This will generate Makefile from Makefile.in.
To make sure the sources arrived intact and work properly on your system, type
make check
It will build all unit tests, and fail if any unit test fails. You must be connected to the Internet, as this will try to download a file from ftp.uu.net.
To build the system tuning tool dklimits, type
make dklimits
Run it on both the client and the server machine; make sure that the number of files it can open is about three times the desired number of users, and that the number of ports it can bind is higher than the desired number of users. You should not be running X Windows or any other programs on the client and server machines when running the benchmark.
To build the benchmark, type
make
This produces the executable dkftpbench, the tuning program dklimits, and a bunch of unit tests (executables with names ending in _test) that you can ignore for now.
Heres a simple use of dkftpbench:
./dkftpbench -n1 -hftp.uu.net -t15 -v
This tells bench to simulate one user fetching the default file from ftp.uu.net repeatedly, and stop after fifteen seconds. The program produces this output:
Option values:
-hftp.uu.net host name of ftp server
-P21 port number of ftp server
-n1 number of users
-t15 length of run (in seconds)
-b3600 desired bandwidth (in bytes per second)
-uanonymous user name
-probouser@ user password
-fusenet/rec.juggling/juggling.FAQ.Z file to fetch
-m1500 bytes per packet
-v1 verbosity
1 users
User0: fetching 22708 bytes took 6.530000 seconds, 3477 bytes per second
User0: fetching 22708 bytes took 6.530000 seconds, 3477 bytes per second
Test over. 1 users left standing.
<<lessThe final result of the benchmark is "the number of simultaneous 28.8 kilobits/second dialup users". To estimate this number, the benchmark starts up a new simulated user as soon as the last one has finished connecting. It stops increasing the number of users when one fails to connect, fails to maintain the desired bandwidth, or the limit specified by the -n option is reached. It runs the simulated users until the amount of time specified by the -t option has elapsed since the last simulated user birth or death; the final score is the number of users still alive at the end.
Main features:
- Compiles and runs on Linux, FreeBSD, and Solaris (or did, last I tried)
- fetches many files in parallel
- waits for each connect to finish (and then a bit) before starting next one; slows down to < 1 connect/second when it reaches 75% of desired number of users. This spreads out user activity more evenly.
- checks bandwidth continuously during each file fetch, stops adding users if any fetch too slow
- throttles each fetch to use only the specified bandwidth
- search for the max number of supported users
- Displays verbose error message when any user fails
- Aborts if it detects the client system running out of resources
- Aborts if connecting to the server takes > 5 seconds
- Aborts if it takes longer than 5 seconds to get first packet of a file
- Uses new Poller class for scalability; you can specify which Poller to use on the commandline
- Supports slow datarates (before, it only handles rates above 80kbits/sec on some systems)
- Lets you set how picky it is about datarates (before, its must be faster than threshold was fixed at 3/4 the target bandwidth)
- Supports alternative readiness notification methods like O_ASYNC and O_ONESIGFD
- Provided both as a standalone executable, and as a Corba object. (Thanks to http://corbaconf.kiev.ua/ for the Corba autoconf macros.
- Switches to BINARY mode after login. (The client API lets you choose; edit robouser.cc to skip the START_TYPE state if you want to use ASCII.)
Example:
After unpacking the sources, configure them for your system with the command
./configure
This will generate Makefile from Makefile.in.
To make sure the sources arrived intact and work properly on your system, type
make check
It will build all unit tests, and fail if any unit test fails. You must be connected to the Internet, as this will try to download a file from ftp.uu.net.
To build the system tuning tool dklimits, type
make dklimits
Run it on both the client and the server machine; make sure that the number of files it can open is about three times the desired number of users, and that the number of ports it can bind is higher than the desired number of users. You should not be running X Windows or any other programs on the client and server machines when running the benchmark.
To build the benchmark, type
make
This produces the executable dkftpbench, the tuning program dklimits, and a bunch of unit tests (executables with names ending in _test) that you can ignore for now.
Heres a simple use of dkftpbench:
./dkftpbench -n1 -hftp.uu.net -t15 -v
This tells bench to simulate one user fetching the default file from ftp.uu.net repeatedly, and stop after fifteen seconds. The program produces this output:
Option values:
-hftp.uu.net host name of ftp server
-P21 port number of ftp server
-n1 number of users
-t15 length of run (in seconds)
-b3600 desired bandwidth (in bytes per second)
-uanonymous user name
-probouser@ user password
-fusenet/rec.juggling/juggling.FAQ.Z file to fetch
-m1500 bytes per packet
-v1 verbosity
1 users
User0: fetching 22708 bytes took 6.530000 seconds, 3477 bytes per second
User0: fetching 22708 bytes took 6.530000 seconds, 3477 bytes per second
Test over. 1 users left standing.
Download (0.26MB)
Added: 2007-06-26 License: GPL (GNU General Public License) Price:
853 downloads
odbc-bench 1.0.0
OpenLink ODBC Bench is an open-source ODBC Benchmarking tool. more>>
OpenLink ODBC Bench is an open-source ODBC Benchmarking tool providing real-time comparative benchmarking for ODBC Drivers, Database Engines, and Operating Systems combinations.
The Benchmarks in this application are loosely based on the TPC-A and TPC-C standard benchmarks, with modifications to specifically test the performance of an ODBC Driver and/or Database Engine in a client/server environment.
The benchmark results can be automatically stored to an ODBC Datasource or XML file for further analysis and comparisons to be made.
ODBC-Bench is licensed under the terms of the GNU General Public License version 2.
<<lessThe Benchmarks in this application are loosely based on the TPC-A and TPC-C standard benchmarks, with modifications to specifically test the performance of an ODBC Driver and/or Database Engine in a client/server environment.
The benchmark results can be automatically stored to an ODBC Datasource or XML file for further analysis and comparisons to be made.
ODBC-Bench is licensed under the terms of the GNU General Public License version 2.
Download (1.3MB)
Added: 2005-11-10 License: GPL (GNU General Public License) Price:
1445 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above pc benchmark search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed