libsrt
ck
| libsrt | ck | |
|---|---|---|
| 1 | 7 | |
| 539 | 2,295 | |
| - | 0.4% | |
| 0.0 | 6.9 | |
| about 1 year ago | 21 days ago | |
| C | C | |
| BSD 3-clause "New" or "Revised" License | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ck
-
Falsehoods programmers believe about undefined behavior
Maybe I'm missing something, but x is not volatile and the compiler is free to assume that it is not modified concurrently outside the bounds of C's memory model. Compilers can and do hoist out loop invariants, and https://github.com/concurrencykit/ck/commit/b54ae5c4ace9b94442bbb46858449069f566d269 seems like an example of compilers doing what you say they don't. What am I missing?
- Concurrency Kit
-
A portable, license-free, lock-free data structure library written in C.
Recommend checking out http://concurrencykit.org instead.
-
Does a thread have a better chance of acquiring a mutex if it's just in time? Or if it's been in the queue? Neither?
If you're interested in how other approaches work, or how one achieves concurrency on shared mutable state without mutual exclusion, would recommend checking out concurrency kit.
-
Libdill: Structured Concurrency for C (2016)
There are plenty of practical solutions to the safe memory reclamation problem in C. The language just doesn't force one on you.
From epoch-based reclamation (https://github.com/concurrencykit/ck/blob/master/include/ck_..., especially with the multiplexing extension to Fraser's classic scheme), to quiescence schemes (https://liburcu.org/), or hazard pointers (https://github.com/facebook/folly/blob/master/folly/synchron..., or https://pvk.ca/Blog/2020/07/07/flatter-wait-free-hazard-poin...)... or even simple using a type-stable (https://www.usenix.org/legacy/publications/library/proceedin...) memory allocator.
In my experience, it's easier to write code that is resilient to hiccups in C than in Java. Solving SMR with GC only offers something close to lock-freedom when you can guarantee global GC pauses are short enough... and common techniques to bound pauses, like explicitly managed freelists land you back in the same problem space as C.
-
C Deep
ck - Concurrency primitives, safe memory reclamation mechanisms and non-blocking data structures. BSD-2-Clause
-
Super-expressive – Write regex in natural language
Indeed they do, https://github.com/concurrencykit/ck
What are some alternatives?
ordered-map - C++ hash map and hash set which preserve the order of insertion
libcds - A C++ library of Concurrent Data Structures
MDAL - Mesh Data Abstraction Library
libdill - Structured concurrency in C
etl - Embedded Template Library
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
Ygg - An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
Thrust - [ARCHIVED] The C++ parallel algorithms library. See https://github.com/NVIDIA/cccl
graphMat - A matrix header-only library, uses graphs internally, helpful when your matrix is part of a simulation where it needs to grow many times (or auto expand)
HPX - The C++ Standard Library for Parallelism and Concurrency
OpenSSL - TLS/SSL and crypto library
CUB - THIS REPOSITORY HAS MOVED TO github.com/nvidia/cub, WHICH IS AUTOMATICALLY MIRRORED HERE.