Search Results for "high performance computing"

Generic data-assimilation toolbox written in java, with native (c and fortran) libraries for high performance computing. Provides tools to couple to your own model and a wide range of algorithms, ranging from parameter calibration to Kalman filters.

...It provides various tools for: - data analysis - sampling - statistical modeling - optimisation - sensitivity analysis - uncertainty analysis - running code on high performance computers - etc. Thanks to ROOT, it is easily scriptable in CINT (c++ like syntax) and Python. Is is available both for Unix and Windows platforms (a dedicated platform archive is available on request). Note : if you have downloaded version 3.12 before the 8th of february, a patch exists for a minor bug on TOutputFileKey file, don't hesitate to ask us.

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.

...TIDES tutorial: Integrating ODEs by using the Taylor Series Method., Monografías de la Academia de Ciencias de la Universidad de Zaragoza. 36, pp. 1-116. * R. Barrio, 2005. Performance of the Taylor series method for ODEs/DAEs, Appl. Math. Comput. 163 (2), pp. 525--545 * R. Barrio, 2006. Sensitivity analysis of ODE's/DAE's using the Taylor series method, SIAM J. on Scientific Computing 27 (6), pp. 1929--1947

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.

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.

This library is meant for high performance calculations for science or 3D games/rasterizers using SIMD instructions of x86 processors to allow an unparalleled level of optimization. This takes advantage of MMX, 3DNow!, 3DNow!+/MMX+, & SSE/SSE2/SSE3/SSSE3

In many parallel scientific applications the process of grid generation, decomposition, message passing, and performance measurements are of similar stucture. The projects intention is to develop a generic function library that will contain all these.