Metraipolis › archive › dc_e7f5f5e4e322
Behind a Simple Read: Understanding Work and Waiting in the Linux I/O Stack — arXiv:2610.10137
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10137
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:50:20.524Z
- SHA-256 of the archived text
7f43c78a7245044ff8d68bc28f33028534c130ec314daf3de22d9031496b58e2- Stable URL of this page
https://metraipolis.com/documento/dc_e7f5f5e4e322
How to cite
Behind a Simple Read: Understanding Work and Waiting in the Linux I/O Stack — arXiv:2610.10137 — arXiv (en), https://arxiv.org/abs/2610.10137 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e7f5f5e4e322 (Metraipolis archive dc_e7f5f5e4e322, sha256 7f43c78a7245044ff8d68bc28f33028534c130ec314daf3de22d9031496b58e2)
BibTeX
@misc{dce7f5f5e4e322,
title = {Behind a Simple Read: Understanding Work and Waiting in the Linux I/O Stack — arXiv:2610.10137},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10137},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e7f5f5e4e322; sha256 7f43c78a7245044ff8d68bc28f33028534c130ec314daf3de22d9031496b58e2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10137. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A simple read interface provides uniform functional semantics, but not equally simple or predictable performance behavior. We use synchronous large-buffer reads in Linux as an observation window and decompose the buffered-read path end to end, distinguishing work volume, processing time, and critical-path exposure. We find that Linux reduces metadata work through large folios and overlaps most cold-read copying with device waiting, but these mechanisms depend on access advice, folio granularity, cache state, and backend execution. Using an experimental kernel prototype, we validate additional opportunities from out-of-order early copying and opportunistic parallelism, while showing that faster request submission does not improve end-to-end performance when SSD supply is already sufficient. To explain device waiting, we abstract first-completion wait $F$ and subsequent completion capacity $B_{CQ}$ from finite request-batch completion timelines. Measurements on a real SSD characterize how they vary with request size and batch size, while MQSim experiments connect them to internal device mechanisms and distinguish finite-batch completion from sustained throughput. We then construct a cross-layer wait chain along the actual folio--bio--request mapping. Independently calibrated device parameters predict waiting at the block layer and at read_pages with errors no greater than approximately 6.9% and 3.2%, respectively. Finally, four use cases apply the model and wait chain to parallel submission, Linux readahead, dependent-read layout, and polling versus sleeping. Their gains, no gains, and gain reversals form a closed loop from observation and modeling to explanation and control, providing a measurable basis for performance decisions in layered I/O stacks.
Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.OS, nuovi lavori del giorno).
Categorie arXiv: Operating Systems (cs.OS).
Pagina del lavoro: https://arxiv.org/abs/2610.10137 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T12:21:00.496Z dalla pagina https://arxiv.org/list/cs.OS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).