The Boehm-Demers-Weiser conservative garbage collector can be used as a garbage collecting replacement for C malloc or C++ new. It allows you to allocate memory basically as you normally would, without explicitly deallocating memory that is no longer useful. The collector automatically recycles memory when it determines that it can no longer be otherwise accessed.

The collector is also used by a number of programming language implementations that either use C as intermediate code, want to facilitate easier interoperation with C libraries, or just prefer the simple collector interface.

Alternatively, the garbage collector may be used as a leak detector for C or C++ programs, though that is not its primary goal.

This C library provides semi-portable access to hardware-provided atomic memory update operations on a number of architectures. These might allow you to write code that does more interesting things in signal handlers, write lock-free code, experiment with thread programming paradigms, etc.

The Boehm-Demers-Weiser conservative garbage collector can be used as a garbage collecting replacement for C malloc or C++ new. It allows you to allocate memory basically as you normally would, without explicitly deallocating memory that is no longer useful. The collector automatically recycles memory when it determines that it can no longer be otherwise accessed.

The collector is also used by a number of programming language implementations that either use C as intermediate code, want to facilitate easier interoperation with C libraries, or just prefer the simple collector interface.

Alternatively, the garbage collector may be used as a leak detector for C or C++ programs, though that is not its primary goal.

The Boehm-Demers-Weiser conservative garbage collector can be used as a garbage collecting replacement for C malloc or C++ new. It allows you to allocate memory basically as you normally would, without explicitly deallocating memory that is no longer useful. The collector automatically recycles memory when it determines that it can no longer be otherwise accessed.

The collector is also used by a number of programming language implementations that either use C as intermediate code, want to facilitate easier interoperation with C libraries, or just prefer the simple collector interface.

Alternatively, the garbage collector may be used as a leak detector for C or C++ programs, though that is not its primary goal.

BenchExec is a framework for reliable benchmarking, which takes care of important low-level details for accurate, precise, and reproducible measurements. In particular, it makes use of cgroups, kernel namespaces, and overlay filesystems to restrict interference of the executed tool with the benchmarking host.

Benchmark is a library to benchmark code snippets, similar to unit tests.

The Phoronix Test Suite is a comprehensive testing and benchmarking platform that provides an extensible framework for which new tests can be easily added. It can carry out both qualitative and quantitative benchmarks in a clean, reproducible, and easy-to-use manner, making it easy to compare one particular setup against another one.

fio is a tool that will spawn a number of threads or processes doing a particular type of I/O action as specified by the user. The typical use of fio is to write a job file matching the I/O load one wants to simulate.

The time utility is a simple and often effective way of measuring how long a command takes to run (wall time). Unfortunately, running a command once can give misleading timings. multitime is, in essence, a simple extension to time which runs a command multiple times and prints the timing means, standard deviations, mins, medians, and maxes having done so. This can give a much better understanding of the command's performance.

sysbench is a scriptable multi-threaded benchmark tool based on LuaJIT. It is most frequently used for database benchmarks, but can also be used to create arbitrarily complex workloads that do not involve a database server. sysbench comes with the following bundled benchmarks:

oltp_*.lua

A collection of OLTP-like database benchmarks.

fileio

A filesystem-level benchmark.

cpu

A simple CPU benchmark.

memory

A memory access benchmark.

threads

A thread-based scheduler benchmark.

mutex

A POSIX mutex benchmark.

It includes features such as:

• Extensive statistics about rate and latency is available, including latency percentiles and histograms.

• Low overhead even with thousands of concurrent threads. sysbench is capable of generating and tracking hundreds of millions of events per second.

• New benchmarks can be easily created by implementing pre-defined hooks in user-provided Lua scripts.

BenchExec is a framework for reliable benchmarking, which takes care of important low-level details for accurate, precise, and reproducible measurements. In particular, it makes use of cgroups, kernel namespaces, and overlay filesystems to restrict interference of the executed tool with the benchmarking host.

Bonnie++ is a benchmark suite that is aimed at performing a number of simple tests of hard drive and file system performance. Bonnie++ allows you to benchmark how your file systems perform with respect to data read and write speed, the number of seeks that can be performed per second, and the number of file metadata operations that can be performed per second.

Microbenchmarks suite to evaluate MPI and PGAS (OpenSHMEM, UPC, and UPC++) libraries for CPUs and GPUs.

A synthetic benchmarking tool to measure peak capabilities of OpenCL devices. It only measures the peak metrics that can be achieved using vector operations and does not represent a real-world use case.

KDiskMark is an HDD and SSD benchmark tool. KDiskMark abstracts away the complexity of the Flexible I/O Tester (fio) command via a convenient graphical user interface (GUI) and handles its output to provide an easy to view and interpret benchmark result. The application is written in C++ with Qt and doesn't have any runtime KDE dependencies. Among its features are:

• Configurable block size, queues, and threads count for each test

• Many languages support

• Report generation.

This package provides benchmarks for implementations of the Message Passing Interface (MPI). It contains MPI performance measurements for point-to-point and global communication, and file, operations for a range of message sizes. The generated benchmark data fully characterize:

• Performance of a cluster system, including node performance, network latency, and throughput;

• Efficiency of the MPI implementation.

Locust is a performance testing tool that aims to be easy to use, scriptable and scalable. The test scenarios are described in plain Python. It provides a web-based user interface to visualize the results in real-time, but can also be run non-interactively. Locust is primarily geared toward testing HTTP-based applications or services, but it can be customized to test any system or protocol.

Note: Locust will complain if the available open file descriptors limit for the user is too low. To raise such limit on a Guix System, refer to info guix --index-search=pam-limits-service-type.

vkmark offers a suite of scenes that can be used to measure various aspects of Vulkan performance. The way in which each scene is rendered is configurable through a set of options.

The BabelStream benchmark measures memory transfer rates between main memory and GPUs. This benchmark is similar in spirit, and based on, John D. McCalpin's STREAM benchmark for CPUs. The version of BabelStream is built targeting AMD GPUs using HIP.

interbench is designed to benchmark interactivity on Linux. It is designed to measure the effect of changes in Linux kernel design or system configuration changes such as CPU, I/O scheduler and filesystem changes and options. With careful benchmarking, different hardware can be compared.

Gcrma adjusts for background intensities in Affymetrix array data which include optical noise and non-specific binding (NSB). The main function gcrma converts background adjusted probe intensities to expression measures using the same normalization and summarization methods as a Robust Multiarray Average (RMA). Gcrma uses probe sequence information to estimate probe affinity to NSB. The sequence information is summarized in a more complex way than the simple GC content. Instead, the base types (A, T, G or C) at each position along the probe determine the affinity of each probe. The parameters of the position-specific base contributions to the probe affinity is estimated in an NSB experiment in which only NSB but no gene-specific binding is expected.

The package xmapbridge can plot graphs in the X:Map genome browser. X:Map uses the Google Maps API to provide a scrollable view of the genome. It supports a number of species, and can be accessed at http://xmap.picr.man.ac.uk. This package exports plotting files in a suitable format. Graph plotting in R is done using calls to the functions xmap.plot and xmap.points, which have parameters that aim to be similar to those used by the standard plot methods in R. These result in data being written to a set of files (in a specific directory structure) that contain the data to be displayed, as well as some additional meta-data describing each of the graphs.

seqLogo takes the position weight matrix of a DNA sequence motif and plots the corresponding sequence logo as introduced by Schneider and Stephens (1990).

This package provides a data package containing summarized Illumina 450k array data on 2800 samples and summarized EPIC data for 2620 samples. The data can be use as a background data set in the interactive application.