Ports Search

Web Polygraph is a benchmarking tool for Web proxies. Polygraph distribution includes a high-performance client and server simulators. The simulators create a stream of HTTP requests that can be routed through a Web proxy. Studying proxy performance under various [stress] conditions is essential for performance tuning, evaluation of new algorithms, analysis of hardware configurations, and comparing available proxy products.

Valley Benchmark is a new GPU stress-testing tool from the developers of the very popular and highly acclaimed Heaven Benchmark. The forest-covered valley surrounded by vast mountains amazes with its scale from a bird's-eye view and is extremely detailed down to every leaf and flower petal. This non-synthetic benchmark powered by the state-of-the art UNIGINE Engine showcases a comprehensive set of cutting-edge graphics technologies with a dynamic environment and fully interactive modes available to the end user. This port includes the linux-binaries of the basic (free-to-use) version of the benchmark.

This port provides classes to support examples, benchmarks, or add special functionality.

UMark is a graphical interface that allows gamers to easily configure and run benchmarks on Unreal Tournament 200x. It supports "botmatch", "flyby", and "timedemo" benchmarks. You may save/load results, or submit them online.

FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. The FFTW package was developed at MIT by Matteo Frigo and Steven G. Johnson. Please send email to fftw@theory.lcs.mit.edu so that we can keep track of users and send you information about new releases. The latest version of FFTW, benchmarks, links, and other information can be found at the FFTW home page.

FFTW is a C subroutine library for computing the Discrete Fourier Transform (DFT) in one or more dimensions, of both real and complex data, and of arbitrary input size. We believe that FFTW, which is free software, should become the FFT library of choice for most applications. Our benchmarks, performed on a variety of platforms, show that FFTW's performance is typically superior to that of other publicly available FFT software. Moreover, FFTW's performance is portable: the program will perform well on most architectures without modification. The FFTW package was developed at MIT by Matteo Frigo and Steven G. Johnson. Please send email to fftw@theory.lcs.mit.edu so that we can keep track of users and send you information about new releases. The latest version of FFTW, benchmarks, links, and other information can be found at the FFTW home page.

Convert::Bencode_XS exists for a couple of reasons, first of all performance. Especially bdecode() is between 10 and 200 times faster than Convert::Bencode version (depending on file): the great speed increase is in part due to the iterative algorithm used. bencode() is written in C for better performance, but it still uses a recursive algorithm. It manages to be around 3 to 5 times faster than Convert::Bencode version. Check out the "extras" directory in this distribution for benchmarks.

Blitz is a PHP templating engine with two main features: Fast. Blitz is written in C and built as PHP-extension which makes it one of the fastest template engines (you may see the benchmarks section below) Clear. Blitz has quite simple and clear syntax and makes developer to build compact and easy-to-read-and-support code even for applications with very complex presentation logic

QScheme is a fast and small implementation of Scheme written in C. QScheme is easy to interface and should be easy to use as an extension language. QScheme currently supports foreign function call and dynamic library. A perl like regular expression module is provided as example. QScheme is really fast: benchmarks (still a little old) shows that it is generaly between 2 and 70 times faster than other scheme interpreters. Documentation and GTK support has been disabled in this port.

This is inspired by Julien Schmidt's httprouter, in that it uses a patricia tree, but the implementation is rather different. Specifically, the routing rules are relaxed so that a single path segment may be a wildcard in one route and a static token in another. This gives a nice combination of high performance with a lot of convenience in designing the routing patterns. In benchmarks, httptreemux is close to, but slightly slower than, httprouter.