Tag
io-scheduling
- Oct 7, 2026 Seek Time, Rotational Latency, and Why the Average Is Not the Middle How a drive decomposes an access into seek, settle, and rotation, why the mean seek is not half the maximum, and how queueing turns latency into a throughput number. hardware engineering
- Jun 11, 2026 Choosing an I/O Scheduler and Setting Queue Depth What an elevator can still do on a device with no seek cost, the difference between the none, mq-deadline, and Kyber schedulers, and how queue depth controls latency. filesystems
- Feb 27, 2026 Readahead Policy and the Read Sizes the Page Cache Actually Sees How the kernel detects sequential access, how far ahead it reads, and why a reader that is fed by readahead measures the cache rather than the storage device. performance engineering
- Sep 27, 2024 Multi-Queue Block Dispatch and Why One Lock Was Not Enough The single-queue block layer, the contention that replaced it, and how software queues, hardware queues, and tags carry a request from submit to completion. filesystems
- Mar 24, 2024 Writeback Scheduling and Merging at the Block Layer How adjacent and overlapping requests become larger ones, what an elevator does with a mixed read and write stream, and why device queue depth changes the picture more than the scheduler name. performance engineering
- Mar 14, 2024 Cleaner Interference and Foreground Latency in Append-Only Storage How a background collector steals device queue slots from the write path, why the resulting latency spikes are bursty rather than average, and the throttling and scheduling measures that bound them. filesystems
- Feb 17, 2023 Merge Scheduling and Latency-Bounded Throttling How a search engine decides which segments to merge and when, and how it keeps merge I/O from spiking query latency while still reclaiming space fast enough. information retrieval