Why Disk I/O Speed Depends on Sequential Access: Page Cache, Scheduling, and B+Tree Insights
This article explains how disk I/O performance is shaped by page cache behavior, sequential versus random access, elevator scheduling, and storage data structures such as B+Tree and LSM trees, showing why operating systems and databases must design for sequential reads and writes to achieve optimal throughput.
