Seqlock
by rigtorp
An implementation of Seqlock in C++11
AI summary
Concurrency primitive
An implementation of a lock-free concurrency primitive in C++11.
- stars
- 196
- forks
- 30
- watching
- 12
- awesome list
- 1
Similar projects
Found by comparing what the projects do, not just their names.
Single producer single consumer queue
A C++ implementation of a bounded single-producer single-consumer queue with wait-free and lock-free semantics
Concurrent Queue
A concurrent queue implementation with bounded capacity, designed for high-performance and low-latency applications.
Function object
Implementation of an alternative function object type to std::function with reduced overhead for low-latency systems.
Thread queue
A thread-safe container for sharing data between threads
Web server
A Coq-based web server written in a functional programming language
Concurrency framework
A C++ concurrency implementation inspired by Golang's style
Queue library
A set of concurrent queue implementations for Nim.
Concurrency semantics
Development of a promising semantics for relaxed-memory concurrency
sustrik/libdill1.7K
Concurrency helpers
Structured concurrency primitives for C to manage concurrent tasks efficiently
Distributed lock manager
An implementation of the Redlock algorithm to provide distributed locking capabilities in .NET applications.
Concurrency locks
Provides a concurrency control mechanism and atomic dynamic shared/exclusive locks for Go applications.
concurrency library
A lightweight, low-overhead concurrency library
Distributed locks
Provides distributed synchronization primitives, such as locks and semaphores, to ensure exclusive access to regions of code across multiple applications or machines.
Concurrency wrapper
A package that provides a WaitGroup with error handling and concurrency control.
Locking primitive
Provides a locking primitive using MySQL's GET_LOCK mechanism to synchronize access in multi-instance applications.
Featured in 1 awesome list
Each link jumps to the spot where the list mentions Seqlock.