ck
FlatBuffers
Our great sponsors
ck | FlatBuffers | |
---|---|---|
7 | 48 | |
2,293 | 22,048 | |
0.9% | 0.9% | |
6.9 | 8.7 | |
9 days ago | 2 days ago | |
C | C++ | |
GNU General Public License v3.0 or later | Apache License 2.0 |
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
FlatBuffers
- FlatBuffers – an efficient cross platform serialization library for many langs
-
Cap'n Proto 1.0
I don't work at Cloudflare but follow their work and occasionally work on performance sensitive projects.
If I had to guess, they looked at the landscape a bit like I do and regarded Cap'n Proto, flatbuffers, SBE, etc. as being in one category apart from other data formats like Avro, protobuf, and the like.
So once you're committed to record'ish shaped (rather than columnar like Parquet) data that has an upfront parse time of zero (nominally, there could be marshalling if you transmogrify the field values on read), the list gets pretty short.
https://capnproto.org/news/2014-06-17-capnproto-flatbuffers-... goes into some of the trade-offs here.
Cap'n Proto was originally made for https://sandstorm.io/. That work (which Kenton has presumably done at Cloudflare since he's been employed there) eventually turned into Cloudflare workers.
Another consideration: https://github.com/google/flatbuffers/issues/2#issuecomment-...
-
Anyone has experience with reverse engineering flatbuffers?
Much more in the discussion of this particular issue onGitHub: flatbuffers:Reverse engineering #4258
-
Flatty - flat message buffers with direct mapping to Rust types without packing/unpacking
Related but not Rust-specific: FlatBuffers, Cap'n Proto.
- flatbuffers - FlatBuffers: Memory Efficient Serialization Library
-
How do AAA studios make update-compatible save systems?
If json files are a concern because of space, you can always look into something like protobuffers or flatbuffers. But whatever you use, you should try to find a solution where you don't have to think about the actual serialization/deserialization of your objects, and can just concentrate on the data.
- QuickBuffers 1.1 released
-
Choosing a protocol for communication between multiple microcontrollers
Or, as an alternative to protobuffers, there's also flatbuffers, which is lighter weight and needs less memory: https://google.github.io/flatbuffers/
- FlatBuffers: FlatBuffers
-
Is using Flatbuffers to parse sensor data a bad application of Flatbuffers?
As the title suggests, I am considering using Flatbuffers as a way to parse sensor data that has been stored in local datafiles. The project language is python.
What are some alternatives?
libcds - A C++ library of Concurrent Data Structures
Protobuf - Protocol Buffers - Google's data interchange format
libdill - Structured concurrency in C
MessagePack - MessagePack implementation for C and C++ / msgpack.org[C/C++]
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
MessagePack - MessagePack serializer implementation for Java / msgpack.org[Java]
Thrust - [ARCHIVED] The C++ parallel algorithms library. See https://github.com/NVIDIA/cccl
Cap'n Proto - Cap'n Proto serialization/RPC system - core tools and C++ library
HPX - The C++ Standard Library for Parallelism and Concurrency
cereal - A C++11 library for serialization
CUB - THIS REPOSITORY HAS MOVED TO github.com/nvidia/cub, WHICH IS AUTOMATICALLY MIRRORED HERE.
Kryo - Java binary serialization and cloning: fast, efficient, automatic