Search Results for "high performance computing"

The Library is for Finite Transforms such as the Number Theoretic Transform (NTT) and Finite Radon Transform (FRT). Current modules include NTTW for NTTs with high resolution (microsecond) timing, basic array and imaging. The transforms are optimised for performance.

LAMA is a framework for developing hardware-independent, high performance code for heterogeneous computing systems. It facilitates the development of fast and scalable software that can be deployed on nearly every type of system with a single code base. By using LAMA for their application, software developers benefit from higher productivity and stay up to date with the latest hardware innovations, both leading to shorter time-to-market.

ViennaGrid is a generic mesh handling library that provides the traversal of structured and unstructured grids in arbitrary spatial dimensions, in particular 1d, 2d and 3d. Quantities can be conveniently stored on mesh elements using ViennaData.

...After selection of the initial frequency candidates, the algorithm passes through all their possible combinations and estimates their multi-frequency statistical significance. In the end, it prints out the set of largest frequency tuples that were still found significant. The GPU computing is implemented through CUDA and brings a significant performance increase. It is still possible to run FreDec solely on CPU, if no suitable GPU device is available in the system. See the details of the underlying theory in Baluev 2013, MNRAS, V. 436, P. 807 The description of the algorithm itself can be found in arXiv:1309.0100. ...

PolyBoRi is implemented as a C++ library for Polynomials over Boolean Rings, which provides high-level data types for Boolean polynomials. A python-interface yields extensible algorithms for computing Groebner bases over Boolean Rings.

parFE is fully-parallel high-performance finite element code targeted to the modeling of trabecular bones in humans. It employs scalable multigrid solvers for efficient solutions on massively parallel computers.

A declarative logic programming system with first-class relations embedded in a pure functional subset of Scheme. The system has true unions, fair scheduling, lexically-scoped logical variables, set-theoretical semantics, high performance without cuts

Parallel Colt is a multithreaded version of Colt - a library for high performance scientific computing in Java. It contains efficient algorithms for data analysis, linear algebra, multi-dimensional arrays, Fourier transforms, statistics and histogramming

BSPonMPI is an implementation of the BSPlib standard on top of MPI. Both MPI and BSPlib are API's of communication routines meant for parallel computing, but BSPlib is easier to learn and its performance easier to predict.

jmathtools, mathematical / scientific java stuff designed to be easily used and modified, not really designed for high performance calculation.

Distributed Java Fractal Generator. DJFractals can computes fractals in arbitrary precision using any CPU available from high performance multi-processors clusters of computers to grid of JavaCards and even at the same time.

CPPScaLapack is a C++ class wrapper for PBLAS and ScaLAPACK with MPI. CPPScaLapack provides a user-friendly interface of high-speed parallel matrix calculation with BLAS and LAPACK techonologies for programers concerning with large-scale computing.