Search Results for "linux partition"

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.

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.

Build elastic data access. Lettuce is a scalable Redis client for building non-blocking Reactive applications. Lettuce is a fully non-blocking Redis client built with netty providing Reactive, Asynchronous and Synchronous Data Access. Lettuce provides asynchronous API with RedisFuture (CompletionStage) and Reactive types Flux [N] and Mono [0|1]. Low-latency communication, backpressure-enabled network engine for NIO TCP, epoll TCP and Unix Domain Sockets. Reactive Streaming is fully...

PerfectClone is a program for easy backup and restore partitions. It is writen in ANSI C with ncurses interface to clone and restore partitions from a LiveCD/USB (GNU/Linux or BSD for example). Some of its most important features are: - Is Free Software (GPLv3). - Completely written in ANSI C (Most people will find it easy to modify and adapt). - Very easy to use, intuitive and friendly through the use of dialog. - Very low resource consumption. - No need a graphics server (runs...

vfTasks is a C library to ease the implementation of concurrent tasks: thread pool to efficiently create and reuse tasks, highly efficient inter-task synchronization, and streaming interfaces to stream data from one task to another.

C library to quickly implement streaming communication between parallel threads. Optimized for use in embedded systems. Allows FIFO behavior as well as separate data access and synchronization. NOTE: development has moved to the vfTasks project.

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.