| Reading LevelDB: The Read Path — Get from Entry to Disk | → |
| Reading LevelDB: Flushing MemTables and the SSTable Format | → |
| Reading LevelDB: The MemTable | → |
| Reading LevelDB: The SkipList Index | → |
| Reading LevelDB: The Arena Region Allocator | → |
| SSE vs SZSE Call Auction: Where the Two Exchanges Tie-Break Differently | → |
| Building a Limit Order Book: Price-Time Priority Matching in C++ | → |
| DPDK Poll Mode Driver: A Deep Dive from Architecture to Implementation | → |
| TCP Message Framing: Reassembling Length-Prefixed Messages from a Byte Stream | → |
| Low-Latency Trading Machine: A Practical Linux Kernel Tuning Guide | → |
| Parsing B3 Exchange Binary UMDF Market Data: From pcap to Order Book | → |
| TSE Itayose Auction Pricing: The Five-Condition Algorithm | → |
| Cache-Friendly Maps: flat_map and unordered_flat_map vs the STL | → |
| Linux rp_filter and Why It Drops Your Trading Packets | → |
| Empty Base Optimization (EBO) and [[no_unique_address]]: Zero-Cost Abstraction in Practice | → |
| Memory Models, Caches, and Pipelines: The Hardware Behind Concurrency | → |
| _GLIBCXX_USE_CXX11_ABI=0: Why the Old ABI Is Slow | → |
| Ray Async Internals (5): Compile-Time Thread Isolation in GCS | → |
| Replace const vector& with std::span: Zero-Cost Generality | → |
| String Split Performance: string_view Is Not Optional | → |
| Ray Async Internals (4): Bridging gRPC and Asio | → |
| Ray Async Internals (3): Thread Pool and Periodic Timer | → |
| Ray Async Internals (2): Event Loop Observability and Chaos Testing | → |
| Ray Async Internals (1): Asio's Role and `instrumented_io_context` | → |
| Auto-Generating C++ Operators with LibClang | → |
| Byte Order Reversal in C++: Bit Twiddling vs. Compiler Builtins | → |
| Immediately Invoked Function Expressions (IIFE) in C++ | → |
| Implementing a Correct C++ Spinlock: TAS, TTAS, and PAUSE | → |
| Optimizing a Ring Buffer for Throughput | → |
| POSIX Sockets API: Tips and Pitfalls | → |
| Ray Internals: The Task, Actor, and Object Model | → |
| Split Locks: The Hidden Cost of Cache-Line-Crossing Atomic Operations | → |
| Structure-Aware Fuzzing for Floating-Point Code with libFuzzer | → |
| Using Huge Pages on Linux | → |
| Virtual Memory and Latency: A Practical Guide for Low-Latency Systems | → |
| C++ Async Safety: Guarding Object Lifetime with `weak_from_this` | → |
| PEP 574: Pickle Protocol 5 and Out-of-Band Data | → |
| Python Multiprocessing: Zero-Copy Data Transfer with shared_memory and Protocol 5 | → |
| C++ Async Callbacks: Lambda Capture and the Destruction Order Fiasco | → |
| Compiler Optimization: Loop Unrolling | → |
| Compiler Optimization: Loop Style Doesn't Matter | → |
| Compiler Optimization: The Cost of Division | → |
| Compiler Optimization: Using lea for Integer Arithmetic | → |
| Compiler Optimization: Loop-Invariant Code Motion (LICM) | → |
| Compiler Optimization: ARM's Barrel Shifter | → |
| Compiler Optimization: Partial Inlining | → |
| Compiler Optimization: Loop Unswitching | → |
| Compiler Optimization: Why xor eax, eax Instead of mov eax, 0 | → |
| Compiler Optimization: How Pointer Aliasing Kills Performance | → |
| Compiler Optimization: Replacing Division with Multiplication | → |
| Compiler Optimization: Inlining —The Master Optimization | → |
| Compiler Optimization: Tail Call Optimization | → |
| Compiler Optimization: Why Floating-Point Resists Vectorization | → |
| Compiler Optimization: How Compilers Optimize switch Statements | → |
| Compiler Optimization: Induction Variables and Loop-Carried Dependencies | → |
| Compiler Optimization: Calling Conventions and Argument Passing | → |
| Compiler Optimization: When LICM Fails —The Aliasing Trap | → |
| Compiler Optimization: How Compilers Compare Fixed-Length Strings | → |
| Compiler Optimization: Multiplying by Constants | → |
| Compiler Optimization: Recognizing the popcount Pattern | → |
| Compiler Optimization: Clang's Algebraic Simplifications | → |
| Compiler Optimization: SIMD and Auto-Vectorization | → |
| view all → | |