TurboPFor
ck
Our great sponsors
TurboPFor | ck | |
---|---|---|
8 | 7 | |
743 | 2,293 | |
- | 0.9% | |
8.5 | 6.9 | |
about 2 months ago | 9 days ago | |
C | C | |
GNU General Public License v3.0 only | 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.
TurboPFor
- Show HN: Time Series Benchmark TurboPFor,TurboFloat,TurboFloat LzX,TurboGorilla
-
Show HN: HN:The Gorilla in the Room:Exploring RedisTimeSeries Optimizations
[4] https://github.com/powturbo/TurboPFor-Integer-Compression/is...
-
Float Compression 9: Lzsse and Lizard
The bytedelta described in the blog is suboptimal and does might not work with other datasets.
Download icapp from https://github.com/powturbo/TurboPFor-Integer-Compression/re... and make your own tests with your data.
[1] https://github.com/powturbo/TurboPFor-Integer-Compression
- Show HN: 1D/2D/3D Lossless/Lossy Floating Point Compression with TurboPFor
-
How do Games manage NPC schedules?
I use a fake database paired with compressed bits for flags and integer compression for various other traits. They follow a navigation guide similar to wind for foliage.
-
Quantile Compression: 35% higher compression ratio for numeric sequences than any other compressor
It could be nice to see a comparison against https://github.com/powturbo/TurboPFor-Integer-Compression !
-
q_compress 0.7: still has 35% higher compression ratio than .zstd.parquet for numerical sequences, now with delta encoding and 2x faster than before
I'm the author of TurboPFor-Integer-Compression. Q_compress is a very interresting project, unfortunatelly it's difficult to compare it to other algorithms. There is not binary or test data files (with q_compress results) available for a simple benchmark. Speed comparison would also be helpfull.
-
C Deep
TurboPFor - Fastest integer compression. GPL-2.0-or-later
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?
x3-rust - X3 Lossless Audio Compression for Rust
libcds - A C++ library of Concurrent Data Structures
libuv - Cross-platform asynchronous I/O
libdill - Structured concurrency in C
42_CheatSheet - A comprehensive guide to 50 years of evolution of strict C programming, a tribute to Dennis Ritchie's language
moodycamel - A fast multi-producer, multi-consumer lock-free concurrent queue for C++11
CRoaring - Roaring bitmaps in C (and C++), with SIMD (AVX2, AVX-512 and NEON) optimizations: used by Apache Doris, ClickHouse, and StarRocks
Thrust - [ARCHIVED] The C++ parallel algorithms library. See https://github.com/NVIDIA/cccl
MessagePack - MessagePack serializer implementation for Java / msgpack.org[Java]
HPX - The C++ Standard Library for Parallelism and Concurrency
encoding - Integer Compression Libraries for Go
CUB - THIS REPOSITORY HAS MOVED TO github.com/nvidia/cub, WHICH IS AUTOMATICALLY MIRRORED HERE.