cameron314/readerwriterqueue
Readerwriterqueue
Acest proiect este o coadă concurentă de tip single-producer single-consumer pentru C++, concepută pentru schimbul de date lock-free între thread-uri. Oferă un mecanism thread-safe pentru transferul datelor fără utilizarea de mutex-uri sau lock-uri.
Coada este implementată ca un buffer circular contiguu care suportă creșterea dinamică a capacității pentru a preveni pierderea datelor atunci când coada atinge limita. Utilizează sincronizarea atomică și gestionarea indicilor de tip wait-free pentru a coordona accesul la date între thread-urile de scriere și cele de citire.
Biblioteca acoperă comunicarea între thread-uri și gestionarea buffer-ului, oferind operațiuni de dequeue atât blocante, cât și non-blocante, pentru a gestiona modul în care thread-urile consumatoare așteaptă date noi.
Features
- Single-Producer Single-Consumer Queues - Implements a specialized single-producer single-consumer model to eliminate contention and minimize synchronization overhead.
- Lock-Free Thread Communication - Provides high-performance primitives for transferring data between threads without the overhead of mutex locking.
- Thread-Safe Communication Channels - Offers a high-performance C++ data structure for safe information passing between concurrent threads.
- Circular Memory Buffers - Uses a ring-based memory layout to efficiently reuse space for data exchange between threads.
- Contiguous Memory Buffers - Allocates elements in flat, contiguous memory blocks to optimize cache locality and reduce latency.
- Lock-Free - Employs atomic primitives and memory barriers to ensure thread-safe data exchange without mutex locks.
- Buffer Capacity Growth - Supports dynamic allocation of larger contiguous blocks when the queue reaches capacity to prevent data loss.
- Wait-Free Synchronization - Manages head and tail indices using atomic integers to guarantee progress for both producer and consumer.
- Dynamic Buffer Management - Manages queue elements by combining upfront memory reservation with dynamic capacity expansion.
- Low Latency Messaging - Minimizes message delivery delay between threads by avoiding traditional mutex synchronization.
- Inter-Thread Buffer Management - Handles data streams between threads using a contiguous memory buffer that grows as demand increases.
- Blocking Synchronization - Implements mechanisms to suspend consumer threads until the producer adds new data to the queue.
- Concurrency and Parallelism - Fast single-producer single-consumer lock-free queue.
