Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Ethereal Packet Sniffing
Understanding The Linux Kernel
Understanding The Linux Kernel
A comparison of interactivity in the Linux 2.6 scheduler and an MLFQ scheduler
Software—Practice & Experience
Interactivity vs. fairness in networked Linux systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards achieving fairness in the Linux scheduler
ACM SIGOPS Operating Systems Review - Research and developments in the Linux kernel
Implementation and experimental performance evaluation of a hybrid interrupt-handling scheme
Computer Communications
Differential virtual time (DVT): rethinking I/O service differentiation for virtual machines
Proceedings of the 1st ACM symposium on Cloud computing
On Linux starvation of CPU-bound processes in the presence of network I/O
Computers and Electrical Engineering
| Hi-index | 0.00 |
In prior research work, it has been demonstrated that Linux can starve CPU-bound processes in the presence of network I/O. The starvation of Linux CPU-bound processes occurs under the two Linux schedulers, namely the 2.6 O(1) scheduler and the more recent 2.6 Completely Fair Scheduler (CFS). In this paper, we analyze the underlying root causes of this starvation problem and we propose effective solutions that can mitigate such starvation. We present detailed implementations of our proposed solutions for both O(1) and CFS Linux schedulers. We empirically evaluate the effectiveness of our proposed solutions in terms of execution time and incoming traffic load. For our experimental study and analysis, we consider two types of mainboard architectures: Uni-Processing (UP) and Symmetric Multi-Processing (SMP). Our empirical results show that the proposed solutions are highly effective in mitigating the starvation problem for CPU-bound processes with no negative impact on the performance of network I/O-bound processes.