Magic Buffers and io_uring Registered Buffers
Summary
The article explores using mmap to create a magic ring buffer where two contiguous virtual memory ranges map the same physical memory, and tests its compatibility with io_uring's registered buffers, finding that it works as expected.
View Cached Full Text
Cached at: 06/18/26, 05:47 AM
Similar Articles
Exploring automatic Buffer Management with io_uring
The article details the implementation of automatic buffer management using io_uring's buffer rings in UringMachine, a Ruby gem for asynchronous I/O. It explains how buffer rings enable efficient multishot read/recv operations by allowing the kernel to use application-provided buffers.
Premature Optimization is Fun Sometimes
A blog post exploring the optimization of a ring buffer data structure for storing ping timestamps, discussing tagged unions, bitfields, and struct padding to reduce memory footprint.
kernel asynchronous reads in PostgreSQL 19 (io_uring)
PostgreSQL 19 introduces kernel asynchronous reads via io_uring, enabling direct asynchronous buffered I/O for improved performance without dedicated worker processes.
@bellicosiX: This one was such a delight to read. This was written with a lot of love. I am grateful. @abhi9u
A comprehensive, book-level blog post covering virtual memory concepts in Linux, including page tables, TLBs, demand paging, copy-on-write, memory-mapped I/O, and performance implications, presented through a dialogue between a process and the kernel.
Epoll vs. Io_uring in Linux
A technical comparison of epoll and io_uring in Linux, explaining their architectures and performance characteristics for asynchronous I/O.