PaRSEC is a generic framework for architecture aware scheduling and management of micro-tasks on distributed many-core heterogeneous architectures.

JUBE helps perform and analyze benchmarks in a systematic way. For each benchmarked application, benchmark data is stored in a format that allows JUBE to deduct the desired information. This data can be parsed by automatic pre- and post-processing scripts that draw information and store it more densely for manual interpretation.

PaStiX (Parallel Sparse matriX package) is a scientific library that provides a high performance parallel solver for very large sparse linear systems based on direct methods. Numerical algorithms are implemented in single or double precision (real or complex) using LLt, LDLt and LU with static pivoting (for non symmetric matrices having a symmetric pattern). This solver also provides some low-rank compression methods to reduce the memory footprint and/or the time-to-solution.

Chameleon is a dense linear algebra solver relying on sequential task-based algorithms where sub-tasks of the overall algorithms are submitted to a run-time system. Such a system is a layer between the application and the hardware which handles the scheduling and the effective execution of tasks on the processing units. A run-time system such as StarPU is able to manage automatically data transfers between not shared memory area (CPUs-GPUs, distributed nodes).

Example showing how to use starpu for implementing a distributed gemm.

PaStiX (Parallel Sparse matriX package) is a scientific library that provides a high performance parallel solver for very large sparse linear systems based on direct methods. Numerical algorithms are implemented in single or double precision (real or complex) using LLt, LDLt and LU with static pivoting (for non symmetric matrices having a symmetric pattern). This solver also provides some low-rank compression methods to reduce the memory footprint and/or the time-to-solution.

Assembles fem matrices using an efficient vectorization method.

Chameleon is a dense linear algebra solver relying on sequential task-based algorithms where sub-tasks of the overall algorithms are submitted to a run-time system. Such a system is a layer between the application and the hardware which handles the scheduling and the effective execution of tasks on the processing units. A run-time system such as StarPU is able to manage automatically data transfers between not shared memory area (CPUs-GPUs, distributed nodes).

pmtool aims at performing post-mortem analyses of the behavior of StarPU applications. Provide lower bounds on makespan. Study the performance of different schedulers in a simple context. Limitations: ignore communications for the moment; branch comms attempts to remove this limitation.

Chameleon is a dense linear algebra solver relying on sequential task-based algorithms where sub-tasks of the overall algorithms are submitted to a run-time system. Such a system is a layer between the application and the hardware which handles the scheduling and the effective execution of tasks on the processing units. A run-time system such as StarPU is able to manage automatically data transfers between not shared memory area (CPUs-GPUs, distributed nodes).

GCC is the GNU Compiler Collection. It provides compiler front-ends for several languages, including C, C++, Objective-C, Fortran, Ada, and Go. It also includes runtime support libraries for these languages.

This package provides a complete GCC tool chain for Fortran development to be installed in user profiles. This includes gfortran, as well as libc (headers and binaries, plus debugging symbols in the debug output), and binutils.

This package provides a complete GCC tool chain for Fortran development to be installed in user profiles. This includes gfortran, as well as libc (headers and binaries, plus debugging symbols in the debug output), and binutils.

GUIX package for the SZ3 compressor.

GUIX package for the SZ compressor.

zfp is a compressed number format for multi-dimensional arrays. zfp provides compressed-array classes (e.g., for in-memory storage) and high-speed, parallel data compression (e.g., for offline storage). zfp supports both lossy and lossless compression and fine-grained user control over accuracy and storage size.

Expect tests are a method of writing tests where instead of hard-coding the expected output of a test, you run the test to get the output, and the test framework automatically populates the expected output.

FTI stands for Fault Tolerance Interface and is a library that aims to give computational scientists the means to perform fast and efficient multilevel checkpointing in large scale supercomputers.

This package has been developed for computing exact distances, without heuristics, between all pairs of reads of a NGS sample. This is a first step for supervised or unsupervised clustering of reads in an environmental sample.

ElementaryX: Elementary Emacs configuration coupled with Guix. Minimal org-mode setup.

ElementaryX: Elementary Emacs configuration coupled with Guix. Setup for ESCode, the Elementaryx fake true Studio Code.

ElementaryX suite: Elementary Emacs configuration coupled with Guix. Setup for the suite composed of Emacs, Vym, ESCode versions. This is a meta-package.

LAPLACIAN is an example of a Laplacian problem. The code is written in Fortran 90.

ElementaryX: Elementary Emacs configuration coupled with Guix. Base setup.