Probabilistic Data Structures, Lock-Free Algorithms, Concurrent Access, Balanced Trees

Over the Fence.... And Far Away....
megalomaniacbore.blogspot.com·7h
🎯Ring Buffers
Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
arxiv.org·2h
🌸Bloom Indexing
Are Linked Lists necessary?
dev.to·1d·
Discuss: DEV
🤐Zipper Structures
State-Compute Replication: Parallelizing High-Speed Stateful Packet Processing
danglingpointers.substack.com·15h·
Discuss: Substack
📡Protocol Stacks
Beating the L1 cache with value speculation (2021)
mazzo.li·1d·
🔮Branch Predictors
Fast Matrix Multiply on an Apple GPU
percisely.xyz·9h·
Discuss: Hacker News
🔀SIMD Programming
The Chip That Spoke Lisp
jxself.org·18h
🖥️Lisp Machines
GaloisInc/parameterized-utils
github.com·4h
📏Linear Haskell
Tiga: Accelerating Geo-Distributed Transactions with Synchronized Clocks
muratbuffalo.blogspot.com·2h·
↔️Bidirectional Sync
Efficiently Updatable Neural Network (NNUE)
beuke.org·1d
🐹Minimal Go
Scaling Cron Job Performance from a Few Thousands to Millions Of Process
dev.to·19h·
Discuss: DEV
🔄Coroutines
Hardware Stockholm Syndrome
programmingsimplicity.substack.com·1d·
Discuss: Substack
🖥️Minimal VMs
Rigorous Evaluation of Microarchitectural Side-Channels with Statistical Model Checking
arxiv.org·2d
📱Bytecode Design
Walrus, A 1M ops/sec, 1 GB/s Write Ahead Log in Rust
nubskr.com·15h·
💾Zero-Copy
What You Didn't Learn in Berkeley CS 188: Intro to RL
neelsomaniblog.com·1d·
Discuss: Hacker News
🔀SSA Construction
[PoC] LatentRecall — an experiment in LLM memory that doesn’t store prompts, but computes them on the fly
zenodo.org·23h·
Discuss: r/LocalLLaMA
💬Smalltalk VMs
Tips for C Programming from Nic Barker
hackaday.com·4h
🔀Control Structures
Fast Generic Hash-Table Update
reddit.com·11h·
📋Row Typing
Making performant Python bindings to compiled code
kylebarron.dev·15h·
Discuss: Hacker News
📋JSON Parsing
Atomic Primitives in Rust: You don’t need a mutex
dev.to·7h·
Discuss: DEV
🔗Concurrency Primitives