The design of the UNIX operating system
The design of the UNIX operating system
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
UNIX internals: the new frontiers
UNIX internals: the new frontiers
A hierarchial CPU scheduler for multimedia operating systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Eliminating receive livelock in an interrupt-driven kernel
ACM Transactions on Computer Systems (TOCS)
Solaris internals: core kernel architecture
Solaris internals: core kernel architecture
Linux in a Nutshell
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Effects of clock resolution on the scheduling of interactive and soft real-time processes
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proportional Share Scheduling of Operating System Services for Real-Time Applications
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Web100: extended TCP instrumentation for research, education and diagnosis
ACM SIGCOMM Computer Communication Review
Desktop scheduling: how can we know what the user wants?
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
The Design and Implementation of the FreeBSD Operating System
The Design and Implementation of the FreeBSD Operating System
Understanding The Linux Kernel
Understanding The Linux Kernel
The Linux(R) Kernel Primer: A Top-Down Approach for x86 and PowerPC Architectures
The Linux(R) Kernel Primer: A Top-Down Approach for x86 and PowerPC Architectures
Process prioritization using output production: Scheduling for multimedia
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Voice over IP Fundamentals (2nd Edition) (Fundamentals)
Voice over IP Fundamentals (2nd Edition) (Fundamentals)
Linux Kernel Development (2nd Edition) (Novell Press)
Linux Kernel Development (2nd Edition) (Novell Press)
Operating System Concepts
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Implementing lottery scheduling: matching the specializations in traditional schedulers
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Sorting Reordered Packets with Interrupt Coalescing
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Linux starvation of CPU-bound processes in the presence of network I/O
Computers and Electrical Engineering
Mitigating starvation of Linux CPU-bound processes in the presence of network I/O
Journal of Systems and Software
| Hi-index | 0.00 |
In general, the Linux 2.6 scheduler can ensure fairness and provide excellent interactive performance at the same time. However, our experiments and mathematical analysis have shown that the current Linux interactivity mechanism tends to incorrectly categorize non-interactive network applications as interactive, which can lead to serious fairness or starvation issues. In the extreme, a single process can unjustifiably obtain up to 95% of the CPU! The root cause is due to the facts that: (1) network packets arrive at the receiver independently and discretely, and the ''relatively fast'' non-interactive network process might frequently sleep to wait for packet arrival. Though each sleep lasts for a very short period of time, the wait-for-packet sleeps occur so frequently that they lead to interactive status for the process. (2) The current Linux interactivity mechanism provides the possibility that a non-interactive network process could receive a high CPU share, and at the same time be incorrectly categorized as interactive. In this paper, we propose and test a possible solution to address the interactivity vs. fairness problems. Experiment results have proved the effectiveness of the proposed solution.