Eliminating Receive Livelock in an Interrupt-Driven Kernel

ACM Transactions on Computer Systems

Volumn 15, Issue 3, 1997, Pages 217-252

  Mogul, Jeffrey C ^a   Ramakrishnan, K K ^b  

^a Digit Equip W Research Laboratory   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Interrupt driven kernel; Livelock; Performance; Polling; Scheduling

Indexed keywords

COMMUNICATION; COMPUTER NETWORKS; COMPUTER SOFTWARE; SCHEDULING;

INTERRUPT-DRIVEN KERNEL; LIVELOCK;

COMPUTER SYSTEMS;

EID: 0031199999     PISSN: 07342071     EISSN: None     Source Type: Journal    
DOI: 10.1145/263326.263335     Document Type: Article

References (30)

1. CHANG, C.-H., FLOWER, R., FORECAST, J., GRAY, H., HAWE, W. R., NADKARNI, A. P., RAMAKRISHNAN, K. K., SHIKARPUR, U. N., AND WILDK, K. M. 1993. High-performance TCP/IP and UDP/IP networking in DEC OSF/1 for Alpha AXP. Digital Tech. J. 5, 1 (Winter), 44-61.
2. CHEN, J. B. AND EUSTACE, A. 1995. Kernel instrumentati¡on tools and techniques. Tech. Rep. TR-26-95, Harvard Univ. Center for Research in Computing Technology, Cambridge, Mass. Nov.
3. DRUSCHEL, P. AND BANGA, G. 1996. Lazy Receiver Processing (LRP): A network subsystem architecture for server systems. In Proceedings of the 2nd Symposium on Operating Systems Design and Implementation. USENIX Assoc., Berkeley, Calif., 261-275.
4. EUSTACE, A. AND SRIVASTAVA, A. 1995. ATOM: A flexible interface for building high performance program analysis tools. In Proceedings of the 1995 USENIX Conference. USENIX Assoc., Berkeley, Calif., 303-313.
5. FALL, K. 1994. A peer-to-peer I/O system in support of I/O intensive workloads. Ph.D. thesis, Univ. of California, San Diego.
6. FALL, K., PASQUALE, J., AND MCCANNE, S. 1995. Workstation video playback performance with competitive process load. In Proceedings of the 5th International Workshop on Network and Operating Systems Support for Digital Audio and Video. IEEE Communications Society, New York, 179-182.
7. FERRARI, D., PASQUALE, J., AND POLYZOS, G. C. 1991. Network issues for Sequoia 2000. Sequoia 2000 Tech. Rep. 91/6, Univ. of California, Berkeley. Dec.
8. FLOYD, S. AND JACOBSON, V. 1993. Random early detection gateways for congestion avoidance. Trans. Networking 1, 4 (Aug.), 397-413.
9. JACOBSON, V. 1990. Efficient protocol implementation. In bound notes provided at ACM SIGCOMM '90Tutorial on "Protocols for High-Speed Networks".
10. LEFFLER, S. J., MCCUSICK, M. K., KARELS, M. J., AND QUARTERMAN, J. S. 1989. The Design and Implementation of the 4.3BSD UNIX Operating System. Addison-Wesley, Reading, Mass.
11. MACKLEM, R. 1991. Lessons learned tuning the 4.3BSD Reno implementation of the NFS protocol. In Proceedings of the Winter 1991 USENIX Conference. USENIX Assoc., Berkeley, Calif., 53-64.
12. MASSALIN, H. AND PU, C. 1990. Fine-grain adaptive scheduling using feedback. Comput. Syst. 3, 1 (Winter), 139-174.
13. MOGUL, J. C. 1989. Simple and flexible datagram access controls for UNIX-based gateways. In Proceedings of the Summer 1989 USENIX Conference. USENIX Assoc., Berkeley, Calif., 203-221.
14. MOGUL, J. C. 1990. Efficient use of workstations for passive monitoring of local area networks. In Proceedings of the SIGCOMM '90 Symposium on Communications Architectures and Protocols. ACM, New York, 253-263.
15. MOGUL, J. C., RASHID, R. F., AND ACCETTA, M. J. 1987. The Packet Filter: An efficient mechanism for user-level network code. In Proceedings of the 11th Symposium on Operating Systems Principles. ACM, Austin, Texas, 39-51.
16. MOSBERGER, D. AND PETERSON, L. L. 1996. Making paths explicit in the scout operating system. In Proceedings of the 2nd Symposium on Operating Systems Design and Implementation. USENIX Assoc., Berkeley, Calif., 153-167.
17. PERLMAN, R. 1983. Fault-tolerant broadcast of routing information. Comput. Networks 7, 6 (Dec.), 395-405.
18. RAMAKRISHNAN, K. K. 1992. Scheduling issues for interfacing to high speed networks. In Proceedings of the Globecom '92 IEEE Global Telecommunications Conference. IEEE, New York, 622-626.
19. RAMAKRISHNAN, K. K. 1993. Performance considerations in designing network interfaces. IEEE J. Sel. Areas Commun. 11, 2 (Feb.), 203-219.
20. RAMAKRISHNAN, K. K., VAITZBLIT, L., GRAY, C., VAHALIA, U., TING, D., TZELNIC, P., GLASER, S., AND DUSO, W. 1995. Operating system support for a video-on-demand file service. Multimedia Syst. 3, 53-65.
21. RANUM, M. J. AND AVOLIO, F. M. 1994. A toolkit and methods for Internet firewalls. In Proceedings of the Summer 1994 USENIX Conference. USENIX Assoc., Berkeley, Calif., 37-44.
22. ROMANOW, A. AND FLOYD, S. 1995. Dynamics of TCP traffic over ATM networks. IEEE J. Sel. Areas Commun. 13, 4 (May), 633-641.
23. SMITH, J. M. AND TRAW, C. B. S. 1993. Giving applications access to Gb/s networking. IEEE Network 7, 4 (July), 44-52.
24. SOUZA, R. J., KRISHNAKUMAR, P. G., ÖZVEREN, C. M., J. SIMCOE, R., SPINNEY, B. A., THOMAS, R. E., AND WALSH, R. J. 1994. GIGAswitch: A high-performance packet switching platform. Digital Tech. J. 6, 1 (Winter), 9-22.
25. SRIVASTAVA, A. AND EUSTACE, A. 1994. ATOM: A system for building customized program analysis tools. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation. ACM, New York, 196-205.
26. TRAW, C. B. S. AND SMITH, J. M. 1993. Hardware/software organization of a high-performance ATM host interface. IEEE J. Sel. Areas Commun. 11, 2 (Feb.), 240-253.
27. VAHALIA, U., GRAY, C. G., AND TING, D. 1995. Metadata logging in an NFS server. In Proceedings of the 1995 USENIX Conference. USENIX Assoc., Berkeley, Calif., 265-276.
28. WALDSPURGER, C. A. 1995. Lottery and stride scheduling: Flexible proportional-share resource management. Tech. Rep. MIT/LCS/TR-667, Massachusetts Institute of Technology Laboratory for Computer Science, Cambridge, Mass. Sept.
29. WALDSPURGER, C. A. AND WEIHL, W. E. 1994. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX Assoc., Berkeley, Calif., 1-11.
30. WALDSPURGER, C. A. AND WEIHL, W. E. 1995. Stride scheduling: Deterministic proportional-share resource management. Tech. Memo. MIT/LCS/TM-528, Massachusetts Institute of Technology Laboratory for Computer Science, Cambridge, Mass. June.