Search Results for "parallel"
Sort By:
Showing 15 open source projects for "parallel"
View related business solutions-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
librsb
A shared memory parallel sparse matrix library including Sparse BLAS.
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. ... -
2
FFTW++ is a C++ header class for the FFTW Fast Fourier Transform library that automates memory allocation, alignment, planning, wisdom, and communication on both serial and parallel (OpenMP/MPI) architectures. In 2D and 3D, hybrid dealiasing of convolutions substantially reduces memory usage and computation time. Wrappers for C, Python, and Fortran are included.
-
3
Freemat is an interpreted, matrix-oriented development environment for engineering and scientific applications, similar to the commercial package MATLAB. Freemat provides visualization, image manipulation, and plotting as well as parallel programming.
-
4
TILP - TI Linking Program
TI graphing calculators <-> computer communication software
TILP (formerly GtkTiLink) can transfer data between Texas Instruments graphing calculators and a computer. It works with all link cables (parallel, serial, Black/Gray/Silver/Direct Link) and it supports the TI-Z80 series (73..86), the TI-eZ80 series (83PCE, 84+CE), the TI-68k series (89, 92, 92+, V200, 89T) and the Nspire series (Nspire Clickpad / Touchpad / CX, both CAS and non-CAS). The project is now managed on Github, https://github.com/debrouxl/tilp_and_gfm . It uses the libti* libraries, https://github.com/debrouxl/tilibs . ... -
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
5
mapgraph
Massively Parallel Graph processing on GPUs -- now part of Blazegraph
Mapgraph is SYSTAP’s disruptive new technology to exploit the main memory bandwidth advantages of GPUs. The early work was co-developed with the University of Utah SCI Institute and has its pedigree in the UINTAH software running on over 750M cores on the TITAN Super Computer. Today, SYSTAP has commercialized this technology into it’s Blazegraph Accelerator and Blazegraph HPC products. Checkout our options for GPU acceleration of graphs or contact us to learn more: ... -
6
PiSvM is a parallel Support Vector Machine (SVM) implementation. It supports C-SVC, nu-SVC, epsilon-SVR and nu-SVR and has a command-line interface similar to the popular LibSVM package.
-
7
Hrothgar Parallel LM/MCMC Minimizer
A versatile MCMC and downhill optimization engine
Hrothgar is a parallel minimizer and Markov Chain Monte Carlo generator by Andisheh Mahdavi of San Francisco State University. It has been used to solve optimization problems in astrophysics (galaxy cluster mass profiles) as well as in experimental particle physics (hadronic tau decays). It is probably adaptable enough to be applied to your merit function if you can write it in C. -
8
GENIE (GEne-geNe IntEraction)
GPU based Parallel Gene-Gene Interaction Analysis
Gene-gene interaction in genetic association studies is computationally intensive when a large number of SNPs are involved. Most of the latest Central Processing Units (CPUs) have multiple cores, whereas Graphics Processing Units (GPUs) also have hundreds of cores and have been recently used to implement faster scientific software. However, currently there are no genetic analysis software packages that allow users to fully utilize the computing power of these multi-core devices for genetic... -
9
Dantzig-Wolfe Solver
An implementation of Dantzig-Wolfe decomposition built upon GLPK
An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link). -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
10
Optimizer for External Function Evaluation. Can handle function and least square minimization. Designed for external time consuming simulators (e.g. FEM simulator, Spice simulator). Can define parallel running tasks for gradient and line minimization
-
11
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.
-
12
-
13
MPIRuby is a Ruby version of the MPI supercomputing standard interface. It enables massively parallel and distributed algorithms to be written in a platform-independent manner suitable for large-scale computation-intensive experiments. MPI is the \"Mes
-
14
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.
-
15
mt-simulated-annealing
Multithreaded Simulated Annealing core in C
A multi threading simulated annealing which can be used to solve any optimization problem running in parallel in all machine cores. Optimization problem definition is open and explained through examples. It is implemented in C and only requires libpthread for running.
- Previous
- You're on page 1
- Next
