Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
medInria is a multi-platform medical image processing and visualization software. medInria offers from standard to cutting-edge processing functionalities for your medical images such as 2D/3D/4D image visualization, image registration, diffusion MR processing and tractography.
The Visualization Toolkit (VTK) is a C++ library for 3D computer graphics, image processing and visualization. It supports a wide variety of visualization algorithms including: scalar, vector, tensor, texture, and volumetric methods; and advanced modeling techniques such as: implicit modeling, polygon reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. VTK has an extensive information visualization framework, has a suite of 3D interaction widgets, supports parallel processing, and integrates with various databases on GUI toolkits such as Qt and Tk.
PaMPA is a C library for dynamic parallel remeshing and redistribution of unstructured meshes.
SimGrid is a scientific instrument to study the behavior of large-scale distributed systems such as grids, "clouds", HPC, and P2P systems. It can be used to evaluate heuristics, prototype applications or even assess legacy MPI applications.
METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes.
SLURM is a fault-tolerant and highly scalable cluster management and job scheduling system for large and small clusters. It allocates access to resources (computer nodes) to users for some duration of time, provides a framework for starting, executing, and monitoring work (typically a parallel job) on a set of allocated nodes, and arbitrates contention for resources by managing a queue of pending work.
TopoMatch leverages on the Scotch library to handle any type of topologies and not only trees. Its main features are: - Handling any type of topologies (tgt Scotch format or hwloc format). - Handle large communication patterns (up to hundreds of thousands of processes and processing units) . - Manage binding constraints: you can specify a subset of the node onto which you want to do the mapping. - Manage oversubscribing: you can specify that more than one processes can be mapped onto a each processing unit. - Deal with logical numbering. Physical core numbering can be used with XML/HWLOC topologies. - Provide exhaustive search for small cases. - Adaptive algorithmic that provide a good trade-off between quality and speed. - Crucial sections of the code are multithreaded. - Optimize I/O to read large input files. - Portable on Unix-like systems (Linux, OS-X, etc.). - Many useful options (level of verbosity, topology optimization, partitioning, etc.).
SCOTCH is a set of programs and libraries which implement the static mapping and sparse matrix reordering algorithms developed within the SCOTCH project. Its purpose is to apply graph theory, with a divide and conquer approach, to scientific computing problems such as graph and mesh partitioning, static mapping, and sparse matrix ordering, in application domains ranging from structural mechanics to operating systems or bio-chemistry.
SCOTCH is a set of programs and libraries which implement the static mapping and sparse matrix reordering algorithms developed within the SCOTCH project. Its purpose is to apply graph theory, with a divide and conquer approach, to scientific computing problems such as graph and mesh partitioning, static mapping, and sparse matrix ordering, in application domains ranging from structural mechanics to operating systems or bio-chemistry.
Fypp is a Python powered preprocessor. It can be used for any programming languages but its primary aim is to offer a Fortran preprocessor, which helps to extend Fortran with condititional compiling and template metaprogramming capabilities. Instead of introducing its own expression syntax, it uses Python expressions in its preprocessor directives, offering the consistency and versatility of Python when formulating metaprogramming tasks. It puts strong emphasis on robustness and on neat integration into developing toolchains.
The open source library MpiFx provides modern Fortran (Fortran 2003) wrappers around routines of the MPI library to make their use as simple as possible. Currently several data distribution routines are covered.
HDF5 tools for use by GEOS
No description on the website
Pugixml is a C++ XML processing library, which consists of a DOM-like interface with rich traversal/modification capabilities, a fast XML parser which constructs the DOM tree from an XML file/buffer, and an XPath 1.0 implementation for complex data-driven tree queries. Full Unicode support is also available, with Unicode interface variants and conversions between different Unicode encodings which happen automatically during parsing/saving.
Conduit is a project from Lawrence Livermore National Laboratory that provides an intuitive model for describing hierarchical scientific data in C++, C, Fortran, and Python. It is used for data coupling between packages in-core, serialization, and I/O tasks.
LvArray is a collection of container classes designed for performance portability in that they are usable on the host and device and provide performance similar to direct pointer manipulation
HDF5 is a suite that makes possible the management of extremely large and complex data collections.
Adiak is a library for recording meta-data about HPC simulations. An HPC application code may, for example, record what user invoked it, the version of the code being run, a computed time history showing density changes, or how long the application spent performing file IO. Adiak represents this metadata as Name/Value pairs. Names are arbitrary strings, with some standardization, and the values are represented by a flexible dynamic type system
librsb is a library for sparse matrix computations featuring the Recursive Sparse Blocks (RSB) matrix format. This format allows cache efficient and multi-threaded (that is, shared memory parallel) operations on large sparse matrices. The most common operations necessary to iterative solvers are available, e.g.: matrix-vector multiplication, triangular solution, rows/columns scaling, diagonal extraction / setting, blocks extraction, norm computation, formats conversion. The RSB format is especially well suited for symmetric and transposed multiplication variants. Most numerical kernels code is auto generated, and the supported numerical types can be chosen by the user at build time. librsb can also be built serially (without OpenMP parallelism), if required. librsb also implements the Sparse BLAS standard, as specified in the [BLAS Technical Forum] documents.
Mongoose is a graph partitioning library. Currently, Mongoose only supports edge partitioning, but in the future a vertex separator extension will be added.
Not Another Completely Heuristic Operating System, or Nachos, is instructional software for teaching undergraduate, and potentially graduate level operating systems courses. As this stage, the package only processes the kernel part (but not the ./test/ part).
PajeNG (Paje Next Generation) is a re-implementation (in C++) and direct heir of the well-known Paje visualization tool for the analysis of execution traces (in the Paje File Format) through trace visualization (space/time view). The tool is released under the GNU General Public License 3. PajeNG comprises the libpaje library, and a set of auxiliary tools to manage Paje trace files (such as pj_dump and pj_validate). The space-time visualization tool called pajeng is deprecated (removed from the sources) since modern tools do a better job (see pj_gantt, for instance, or take a more general approach using R+ggplot2 to visualize the output of pj_dump). This effort was started as part of the french INFRA-SONGS ANR project. Development has continued through a collaboration between INF/UFRGS and INRIA.
This is a package used to run an AVBP test suite.
AVBP is a 3D Navier-Stokes compressible DNS/LES solver co-developped by CERFACS and IFP-EN until version 7.3. Since, CERFACS ensures the alone development and improvement of the code.