The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.
When poll is better than interrupt
Abstract
In a traditional block I/O path, the operating system completes virtually all I/Os asynchronously via interrupts. However, performing storage I/O with ultra-low latency devices using next-generation non-volatile memory, it can be shown that polling for the completion - hence wasting clock cycles during the I/O - delivers higher performance than traditional interrupt-driven I/O. This paper thus argues for the synchronous completion of block I/O first by presenting strong empirical evidence showing a stack latency advantage, second by delineating limits with the current interrupt-driven path, and third by proving that synchronous completion is indeed safe and correct. This paper further discusses challenges and opportunities introduced by synchronous I/O completion model for both operating system kernels and user applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Strukov, D. B., Snider, G. S., Stewart, D. R., & Williams, R. S. (2008) · Nature · doi:10.1038/nature06932 · Cited by 11,828
Cited by
System software for persistent memory
Dulloor, S. R., Kumar, S., Keshavamurthy, A., Lantz, P., Reddy, D., Sankaran, R., & Jackson, J. (2014) · Proceedings of the Ninth European Conference on Computer Systems · doi:10.1145/2592798.2592814 · Cited by 617
NetVM: High Performance and Flexible Networking Using Virtualization on Commodity Platforms
Hwang, J., Ramakrishnan, K. K., & Wood, T. (2015) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2015.2401568 · Cited by 357
Metadata
- Authors
- Yang, J., Minturn, D., & Hady, F.
- Venue
- File and Storage Technologies
- Published
- 2012-02-14
- Pages
- 3-3
- DOI
- 10.5555/2208461.2208464
- OpenAlex
- W31171581
- Cited by
- 165
- References
- 1
- FWCI
- 23.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: When poll is better than interrupt. https://app.cochat.ai/papers/10.5555/2208461.2208464
- The paper
- Yang, J., Minturn, D., & Hady, F. (2012). When poll is better than interrupt. File and Storage Technologies. https://doi.org/10.5555/2208461.2208464
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.