5 projects tagged "Parallel processing"
Updated 09 May 2013
HPCC Systems
| Pop | 374.94 |
|---|---|
| Vit | 32.27 |
HPCC (High Performance Computing Cluster) stores and processes large quantities of data, processing billions of records per second using massive parallel processing technology. Large amounts of data across disparate data sources can be accessed, analyzed, and manipulated in fractions of seconds. HPCC functions as both a processing and a distributed data storage environment capable of analyzing terabytes of information.
Updated 05 Oct 2010
Charm++
| Pop | 24.52 |
|---|---|
| Vit | 1.00 |
Charm++ is a portable adaptive runtime system for parallel applications. Application developers create an object-based decomposition of the problem of interest, and the runtime system manages issues of communication, mapping, load balancing, fault tolerance, and more. Sequential code implementing the methods of these parallel objects is written in C++. Calls to libraries in C++, C, and Fortran are common and straightforward. Charm++ is portable across individual workstations, clusters, accelerators (Cell SPEs and GPUs), and supercomputers such as those sold by IBM (Blue Gene, POWER) and Cray (XT3/4/5/6). Applications based on Charm++ are used on at least 5 of the 20 most powerful computers in the world.
Updated 30 Apr 2010
RunJRun
| Pop | 27.82 |
|---|---|
| Vit | 33.45 |
RunJRun is a very simple system for doing parallel processing in Java, using Amazon Elastic Compute Cloud (EC2) instances as compute nodes. The basic compute unit is a Runnable, Serializable Java object, a "task" for short. A user submits a list of such tasks to RunJRun. Each task then has its run() method invoked on an EC2 instance. To use it, you'll need an Amazon Machine Image (AMI) that has the RunJRun server-side software installed; several such AMIs are available.
Updated 09 Dec 2012
FastFlow
| Pop | 121.29 |
|---|---|
| Vit | 6.24 |
FastFlow is a pattern-based programming framework targeting streaming applications. It implements pipeline, farm, divide and conquer, and their composition, as well as generic streaming networks. It is specifically designed to support the development and the seamless porting of existing applications on multi-core. The layered template-based C++ design ensures flexibility and extendibility. Its lock-free/fence-free run-time support minimizes cache invalidation traffic and enforces the development of high-performance (high-throughput, low-latency) scalable applications. It has been proven faster than TBB, OpenMP, and Cilk on several micro-benchmarcks and real-world applications, especially when dealing with fine-grained parallelism and high-throughput applications.
Updated 26 Apr 2013
JPPF
| Pop | 844.18 |
|---|---|
| Vit | 80.38 |
JPPF makes it easy to parallelize computationally intensive tasks and execute them on a Grid.
