Search Results for "partition"

SOFAJRaft is a production-level, high-performance Java implementation based on the RAFT consistency algorithm that supports MULTI-RAFT-GROUP for high-load, low-latency scenarios. With SOFAJRaft you can focus on your business area. SOFAJRaft handles all RAFT-related technical challenges. SOFAJRaft is very user-friendly, which provides several examples, making it easy to understand and use.

php-rdkafka is a PHP extension that provides a binding to librdkafka, the C library for Apache Kafka. It enables PHP applications to produce and consume messages efficiently from Kafka topics, supporting both low-level and high-level APIs. The extension is ideal for integrating Kafka into high-performance, real-time systems built with PHP.

...Its simple yet powerful programming model allows you for trivial use-cases as well as for chained asynchronous flows. Redis Standalone, Master/Slave, Redis Sentinel and Redis Cluster. Lettuce connects with all operational models natively supported by Redis. Partition-tolerance, Read Slaves and Transport-Level-Security provide the required foundation for highly scalable applications.

...Bioluminescence implements a novel algorithm which uses an artificial neural network to classify contigs in a genome assembly as haplotype-specific or not-haplotype-specific. It then uses this information to partition the original input read set into two subsets, each of which has been enriched for one of the haplotypes. Initial results using this technique have dramatically improved de novo asseblies of such data. The implementation provided here remains partial, and under daily development, and is released as a daily "snapshot" as opposed to a static version.

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.