Search Results for "parallel-sudoku-solver" - Page 40
Sort By:
Showing 2100 open source projects for "parallel-sudoku-solver"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
VarScan
Variant detection in next-generation sequencing data
Variant detection in massively parallel sequencing. For one sample, calls SNPs, indels, and consensus genotypes. For tumor-normal pairs, further classifies each variant as Germline, Somatic, or LOH, and also detects somatic copy number changes. THE LATEST VERSION IS AVAILABLE ON GITHUB -
2
kidsudoku
Simple sudoku game for kid.
I'm a father and I have a lovely daughter. I want to give her a gift, a sudoku game, but she is too young to play the real sudoku, so make it simple!! -
3
This project aims to provide bit-parallel based string comparison tools on modern accelerators, as well as on common multi-core CPUs. Fundamentally, these tools are specified for biological data (i.e DNA, RNA sequences), however, they could also be extended to process other types of text data.
-
4
CUDA-Quicksort
CUDA-Quicksort: A GPU-based implementation of the quicksort algorithm
..."Two GPU-based implementations of the quicksort were presented in literature: the GPU-quicksort, a compute-unified device architecture (CUDA) iterative implementation, and the CUDA dynamic parallel (CDP) quicksort, a recursive implementation provided by NVIDIA Corporation."[*]. CUDA-quicksort is an iterative GPU-based implementation of the quicksort algorithm. "Experiments performed on six sorting benchmark distributions show that CUDA-quicksort is up to four times faster than GPU-quicksort and up to three times faster than CDP-quicksort."[*]. ... -
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.
-
5
Parallel
Parallel - Task parallelism in JS
Parallel is a JS library that enables you to run several tasks in parallel and also also take advantage of multi-core CPUs. Benchmarks: http://jsperf.com/parallel -
6
-
7
Fluid Gravity 3way
there are 3 observers to every curve, each seeing the other 2
I recently dug up some of my old simulations after to my surprise 3SAT and a theoretical expansion of boltzmann statistics reminded me I already simulated something like that but I didnt know how good a simulation it was. Check how the varying density and shape of electron clouds and soliton-like or fluid drop like blobs of field gradually start to point outward and get thinner, like a soliton is bell curve shaped as seen from outside. More importantly, compare the 2 halfs of electron cloud... -
8
jAgg
jAgg - Java Aggregation Operations
jAgg is a Java 5.0 API that supports “group by” operations on Lists of Java objects: aggregate operations such as count, sum, max, min, avg, and many more. It supports Super Aggregation: Rollups, Cube, and Grouping Sets. It supports analytic operations such as lag/lead and row number and more. It also allows custom aggregate and analytic operations. -
9
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
10
PANET, a Cytoscape plugin is developed to efficiently analyze the robustness-related dynamics and feed-forward/feedback loop structures of biological networks. This is an advanced plugin of NetDS (http://netds.sourceforge.net/). We employed OpenCL library to make the time-consuming parts of NetDS are processed in parallel. Finally, in comparison to the original NetDS, PANET performed large-scale robustness calculation and feed-forward/feedback loop examination faster by several hundred times for a human signaling network with 1609 nodes and 5063 links.
-
11
parSRA
Portable Framework for the Parallel Execution of Short Read Aligners
...It uses the following techniques in order to improve scalability: 1) a fast splitting of the input reads using the FUSE kernel module available in most of current Linux distributions; 2) a balanced on-demand distribution of the reads based on the shared locks of UPC++, an extension of C++ for parallel computing that follows the Partitioned Global Address Space (PGAS) paradigm. parSRA is portable as its configuration file allows the users to parallelize the execution of existing SRA tools without the need to modify the source code of parSRA or the aligner. -
12
This is the installer of all applications created by Renato Alexandre Santos Freitas The following applications can be found in the package: · Easiest Calendar Creator · Numerical Systems Calculator · Numerical Systems Converter · Price Tag Details · Date Difference Calculator · Testing Arithmetic Knowledge · Current Time Designator · Week Days Finder · Triangles Rectangles Solver · Advanced Trigonometry Calculator · Advanced Exponentials Informer · Advanced Roots Informer · Advanced Exponentials Calculator · Advanced Roots Calculator · Advanced Arithmetic Calculator · Arithmetic Matrix Calculator · Square Numbers Informer · Simple Text Codifier and Decodifier · Prime Numbers Informer
-
13
GTkNN
GPU-based Textual kNN (GT-kNN)
The following code is a parallel kNN implementation that uses GPUs for the high dimensional data in text classification. You can use it to classify documents using kNN or to generate meta-features based on the distances between a query document and its k nearest neigbors -
14
Ichnaea
Performance Timing Tools
Ichnaea is a set of tools that aid in collecting and tracking parameters and timings for parallel applications. The Performance Modelling Timing Module, PMTM, is a library that wraps system timing calls to abstract these from code developers and aid portability. It also has functionality to store parameters and print those, along with the timing information to a comma separated variable file. The Performance Modelling Analysis Tool, PMAT, is coming soon. -
15
SWAPHI-LS: Alignment on Xeon Phi Cluster
Smith-Waterman long DNA sequence alignment on Xeon Phi clusters
The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host. -
16
Chemical Kinectics Solver
Basic Chemical Kinetics Solver
The project lives on GitHub - please see: https://github.com/DetlevCM/chemical-kinetics-solver -
17
JPOP is a pure java parallel optimization package based on the Optimization Java Package. It supports analytical gradients and Hessians for non-linear optimization. JPOP is based on uncmin in Fortran but employs java arrays and object oriented code.
-
18
MPJ Express is an implementation of an MPI-like API—standardized by the Java Grande forum—used to write parallel Java applications, which can execute on a variety of parallel platforms ranging from multicore processors to compute clusters/clouds.
-
19
Distributed Video Transcoding
Distributed Video Transcoding
...Also we want to build this solution on top of CentOS and ffmpeg. So I decided to design and develop "Simple Scalable, Parallel, Multi-bitrate Video Transcoding System" by myself. -
20
Agilefant
The scalable open source tool for lean and agile project management
Agilefant is a simple but powerful web based tool for lean and agile project management. It is the most versatile open source solution of its kind today, with a rapidly growing user base of more than 10k users around the world in thousands of organizations. Based on more than ten years of solid scientific research within real world organizations, Agilefant's unique model scales from personal todo-lists to large-scale multi-team development and long-term product and portfolio... -
21
COMRAD-MPI
Compression of Large Genomic Datasets using Parallel Computing
COMRAD-MPI is a parallel computing algorithm for reducing the computational time for compressing the large genomic data sets based on COMRAD algorithm. It captures the long range repeat redundancies in large genomes there by providing a way to compress the large DNA data set. Three stages- Substitution, Clean up and Huffman encoding have been parallelized using message passing library. -
22
SWAPHI: Smith-Waterman on Intel Xeon Phi
The first protein sequence database search on shared-host Xeon Phis
The first parallel algorithm to accelerate the Smith-Waterman protein database search on shared-host multiple Intel Xeon Phi coprocessors. By searching against the UniProtKB/TrEMBL database, SWAPHI achieves a performance of up to 58.8 billion cell updates per second (GCUPS) on a single Xeon Phi and up to 228.4 GCUPS on four Xeon Phis. -
23
RPlite
RankProduct implementation for differential expression analysis
...It allows the user to perform meta-analysis of different transcriptomic datasets (with different protocols, platforms, technologies, batch, etc.). This implementation computes both up and down regulations in one pass. It is parallelized (dependency: parallel) and memory-optimized: the user can specify the maximum size of the matrices in memory (parameter size) for the unpaired test. -
24
CUDAlign
CUDAlign is a tool that aligns huge DNA sequences in CUDA capable GPUs
...Look at the following papers for detailed information: [1] Edans Sandes, Alba Melo. Retrieving Smith-Waterman Alignments with Optimizations for Megabase Biological Sequences using GPU. IEEE Transactions on Parallel and Distributed Systems, vol. 99, PrePrints, 2012 [2] Edans Sandes, Alba Melo. Smith-Waterman Alignment of Huge Sequences with GPU in Linear Space. IPDPS 2011: 1199-1211 [3] Edans Sandes, Alba Melo. CUDAlign: using GPU to accelerate the comparison of megabase genomic sequences. PPOPP 2010: 137-146 The latest source code can be found in Github. ... -
25
GSS Engine
GSS engine
GSS is a JavaScript layout engine based on Grid Style Sheets (constraint CSS) using Cassowary constraint solver. It enables declarative relational layouts—expressing 'item A aligned to the right of item B'—and compiles these constraints into standard styles at runtime or build-time. Though experimental and labeled unstable, it showcases advanced layout paradigms beyond traditional CSS.
