Optimizing Storage Performance with Calibrated Interrupts
Amy Tai, Igor Smolyar, Michael Wei, Dan Tsafrir
Abstract
After request completion, an I/O device must decide whether to minimize latency by immediately firing an interrupt or to optimize for throughput by delaying the interrupt, anticipating that more requests will complete soon and help amortize the interrupt cost. Devices employ adaptive interrupt coalescing heuristics that try to balance between these opposing goals. Unfortunately, because devices lack the semantic information about which I/O requests are latency-sensitive, these heuristics can sometimes lead to disastrous results.
Instead, we propose addressing the root cause of the heuristics problem by allowing software to explicitly specify to the device if submitted requests are latency-sensitive. The device then "calibrates" its interrupts to completions of latency-sensitive requests. We focus on NVMe storage devices and show that it is natural to express these semantics in the kernel and the application and only requires a modest two-bit change to the device interface. Calibrated interrupts increase throughput by up to 35%, reduce CPU consumption by as much as 30%, and achieve up to 37% lower latency when interrupts are coalesced.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 06e432cb-d46b-45a2-bad7-43034d7a161eCited by top-tier papers7
- Electrode: Accelerating Distributed Protocols with eBPFYang Zhou, Zezhou Wang, Sowmya Dharanipragada, Minlan YuNSDI 2023 · 78 citations
- ScalaCache: Scalable User-Space Page Cache Management with Software-Hardware CoordinationLi Peng, Yuda An, You Zhou, Chenxi Wang et al.USENIX ATC 2024 · 6 citations
- I/O in a Flash: Evolution of ONTAP to Low-Latency SSDsMatthew Curtis-Maury, Ram Kesavan, Bharadwaj V. R., Nikhil Mattankot et al.FAST 2024 · 3 citations
- DPAS: A Prompt, Accurate and Safe I/O Completion Method for SSDsDongjoo Seo, Jihyeon Jung, Yeohwan Yoon, Ping-Xiang Chen et al.FAST 2026 · 1 citation
- VLM in a flash: I/O-Efficient Sparsification of Vision-Language Model via Neuron ChunkingKichang Yang, Seonjun Kim, Minjae Kim, Nairan Zhang et al.NeurIPS 2025 · 1 citation
Builds on3
- SplinterDB: Closing the Bandwidth Gap for NVMe Key-Value StoresAlexander Conway, Abhishek Gupta, Vijay Chidambaram, Martin Farach-Colton et al.USENIX ATC 2020 · 90 citations
- Autonomous NIC offloadsBoris Pismenny, Haggai Eran, Aviad Yehezkel, Liran Liss et al.ASPLOS 2021 · 32 citations
- Scalable Parallel Flash Firmware for Many-core ArchitecturesJie Zhang, Miryeong Kwon, Michael M. Swift, Myoungsoo JungFAST 2020 · 13 citations
Related papers
- Selective On-Device Execution of Data-Dependent Read I/OsChanyoung Park, Minu Chung, Hyungon MoonFAST 2025 · 2 citations
- Daredevil: Rescue Your Flash Storage from Inflexible Kernel Storage StackJunzhe Li, Ran Shu, Jiayi Lin, Qingyu Zhang et al.EuroSys 2025 · 2 citations
- D2FQ: Device-Direct Fair Queueing for NVMe SSDsJiwon Woo, Minwoo Ahn, Gyusun Lee, Jinkyu JeongFAST 2021 · 45 citations
- I/O Passthru: Upstreaming a flexible and efficient I/O Path in LinuxKanchan Joshi, Anuj Gupta, Javier González, Ankit Kumar et al.FAST 2024 · 19 citations
- CoINT2: A Heuristic Coordinator for Responsive Receive-Side Network I/O Virtualization in Overcommitment CloudXu Huan, Jian Li, Haibing GuanINFOCOM 2025 · 1 citation
