Eliminating receive livelock in an interrupt-driven kernel (1997)
Cached
Download Links
- [cs.unomaha.edu]
- [www.stanford.edu]
- [pdos.csail.mit.edu]
- [pdos.lcs.mit.edu]
- [www.cs.utexas.edu]
- [www.pdos.lcs.mit.edu]
- [pdos.csail.mit.edu]
- [www.cs.brown.edu]
- [www.cs.brown.edu]
- [pdos.lcs.mit.edu]
- [dcslab.snu.ac.kr]
- [ftp.digital.com]
- [www.cs.ucla.edu]
- [www.hpl.hp.com]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Computer Systems |
| Citations: | 241 - 4 self |
BibTeX
@ARTICLE{Mogul97eliminatingreceive,
author = {Jeffrey Mogul and Dec Western and Jeffrey C. Mogul and K. K. Ramakrishnan},
title = {Eliminating receive livelock in an interrupt-driven kernel},
journal = {ACM Transactions on Computer Systems},
year = {1997},
volume = {15},
pages = {217--252}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most operating systems use interface interrupts to schedule network tasks. Interrupt-driven systems can provide low overhead and good latency at low of-fered 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 its time processing interrupts, to the exclusion of other neces-sary 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 operat-ing system must schedule network interrupt handling as carefully as it schedules process execution. We modified an interrupt-driven networking implemen-tation to do so; this eliminates receive livelock without degrading other aspects of system performance. We present measurements demonstrating the success of our approach. 1.
