The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Eliminating receive livelock in an interrupt-driven kernel
Abstract
Most operating systems use interface interrupts to schedule network tasks. Interrupt-driven systems can provide low overhead and good latency at low offered load, but degrade significantly at higher arrival rates unless care is taken to prevent several pathologies. These are various forms of receive livelock , in which the system spends all of its time processing interrupts, to the exclusion of other necessary tasks. Under extreme conditions, no packets are delivered to the user application or the output of the system. To avoid livelock and related problems, an operating system must schedule network interrupt handling as carefully as it schedules process execution. We modified an interrupt-driven networking implementation to do so; this modification eliminates receive livelock without degrading other aspects of system performance. Our modifications include the use of polling when the system is heavily loaded, while retaining the use of interrupts ur.Jer lighter load. We present measurements demonstrating the success of our approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
ATOM: a system for building customized program analysis tools
Srivastava, A., & Eustace, A. (1994) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/178243.178260 · Cited by 981
Lottery scheduling: flexible proportional-share resource management
Waldspurger, C. A., & Weihl, W. E. (1994) · doi:10.5555/1267638.1267639 · Cited by 637
Making paths explicit in the Scout operating system
Mosberger, D., & Peterson, L. L. (1996) · Proceedings of the second USENIX symposium on Operating systems design and implementation · doi:10.1145/238721.238771 · Cited by 282
The packer filter: an efficient mechanism for user-level network code
Mogul, J., Rashid, R., & Accetta, M. (1987) · ACM SIGOPS Operating Systems Review · doi:10.1145/37499.37505 · Cited by 248
Self-citationLazy receiver processing (LRP): a network subsystem architecture for server systems
Druschel, P., & Banga, G. (1996) · Proceedings of the second USENIX symposium on Operating systems design and implementation · doi:10.1145/238721.238786 · Cited by 232
Fine-Grain Adaptive Scheduling using Feedback
Massalin, H., & Pu, C. (1989) · Cited by 42
Cited by
Kohler, E., Morris, R., Chen, B., Jannotti, J., & Kaashoek, M. F. (2000) · ACM Transactions on Computer Systems · doi:10.1145/354871.354874 · Cited by 2,413
Characteristics of scalability and their impact on performance
Bondi, A. B. (2000) · Proceedings of the 2nd international workshop on Software and performance · doi:10.1145/350391.350432 · Cited by 523
Morris, R., Kohler, E., Jannotti, J., & Kaashoek, M. F. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319166 · Cited by 363
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
Self-citationA catalog of stream processing optimizations
Hirzel, M., Soulé, R., Schneider, S., Gedik, B., & Grimm, R. (2014) · ACM Computing Surveys · doi:10.1145/2528412 · Cited by 299
Metadata
- Authors
- Mogul, J. C., & Ramakrishnan, K. K.
- Venue
- ACM Transactions on Computer Systems
- Published
- 1997-08
- Volume
- 15
- Issue
- 3
- Pages
- 217-252
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W1482102510
- Cited by
- 452
- References
- 7
- FWCI
- 27.91
- 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
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.