Off-Heap Algorithms in Java
7 articles in this series
Off-Heap Algorithms in Java: The Ring Buffer Foundation
From a naive heap-based queue to an off-heap ring buffer with dramatically better throughput, tail latency, and GC behavior for high-frequency trading workloads.
AArthur Costa
Wait-Free SPSC Queues in Java
How to replace synchronized queue handshakes with a wait-free Single-Producer Single-Consumer ring buffer that uses precise memory ordering instead of locks.
AArthur Costa
Lock-Free MPSC Queues in Java
How to replace locked many-producer queues with a lock-free Multi-Producer Single-Consumer ring buffer coordinated entirely by CAS and sequence numbers.
AArthur Costa
MPMC Queues in Java: The Final Boss
How to build a dual-CAS Multi-Producer Multi-Consumer ring buffer in Java that scales on both ends without collapsing under lock contention.
AArthur Costa
Event Pipelines in Java: The LMAX Disruptor Pattern
How to chain SPSC queues into a high-throughput event pipeline, following the LMAX Disruptor pattern for multi-stage processing with sub-microsecond latency.
AArthur Costa
Wait-Free Telemetry: Never-Blocking Observability
Build wait-free telemetry buffers that never block producers, with overwrite semantics for high-frequency trading observability that doesn't impact system performance.
AArthur Costa
Sharded Processing: Per-Core Isolation for Zero Contention
Eliminate contention entirely with per-CPU-core sharded buffers, thread affinity, and isolated processing lanes for maximum parallelism.
AArthur Costa