Search Results for "parallel" - Page 2

DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. ...

...However, along with its rapid development, the data magnitude and analysis complexity for NGS far exceed the capacity and capability of traditional small-scale computing facilities, such as multithreading algorithms on standalone workstations. To address this issue, here we present a solution using the ever-increasing supply of processing power by massive parallel processing (MPP) systems.

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).

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.

Download Free Associated R open source script files for big data analysis with Hadoop and R These are R script source file from Ram Venkat from a past Meetup we did at http://www.meetup.com/R-Matlab-Users/events/85160532/ Also, there is a long video and Powerpoint presentation slide PDF with R files at: http://quantlabs.net/blog/2012/11/how-to-use-hadoop-and-r-for-big-data-parallel-processing-free-download-pdf/ Download source files from http://quantlabs.net/blog/2012/11/download-free-associated-r-open-source-script-files-for-big-data-analysis-with-hadoop-and-r-rstats-hadoop/

Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM

Tina's Random Number Generator Library (TRNG) is a state of the art C++ pseudo-random number generator library for sequential and parallel Monte Carlo simulations.

A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.

APCO means Adaptive Parallel COmputing framework.

"UltraQueue" is a library (DLL) project, written in C++. This library is intended to be used for very fast temporary data storage, aquired by any possible source (File, Serial Port, ...). Users can create multiple queues of differrent sizes & types

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.

Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.

On open source MPI implementation of parallel bucket sorting. This implementation is scalable and gives linear speedup on SGI(Altix). The program sorts at using the bits and hence is stronger than other sorters which make assumptions about keys.

This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.

QuickMP (Quick Multi-Processing) is a simple cross-platform C++ API for generating parallel for loops in shared-memory programs, similar to OpenMP. It provides automatic scalable performance based on the number of available processors.

This project uses massively parallel Graphics Processing Units(GPU) for neural network(Backpropagation) purposes.

PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.

The Distributed Genetic Programming Framework is a scalable Java genetic programming environment. It comes with an optional specialization for evolving assembler-syntax algorithms. The evolution can be performed in parallel in any computer network.

This Project implements the mergesort algorithm in a MPICH2 (parallel programming -) environment.

User friendly application with graphical interface, for creating and training a multi-layer feed-forward neural-networks. The application is intended for systems of GRID computation.

SCOPE stands for Symbolic COmputation Parallel Environment. We aim at providing an environment for symbolic computation, that is easily expandable, easy to use, parallel, effective and free.

The LisBON Framework is an adaptable framework for developing new parallel Memetic Algorithms (hybrid search algorithms for efficiently solving optimisation problems).