On Linux starvation of CPU-bound processes in the presence of network I/O

摘要: Process starvation is a critical and challenging design problem in operating systems. A slight of processes can lead to undesirable response times. In this paper, we experimentally demonstrate that Linux starve CPU-bound the presence network I/O-bound processes. Surprisingly, be encountered at only particular range traffic rates being received by Lower or higher do not exhibit starvation. We have analyzed it under different applications, system settings configurations. show such may exist for two scheduler, namely 2.6 O(1) scheduler more recent Completely Fair Scheduler (CFS). instrumented profiled kernel investigate underlying root causes addition, suggest possible mitigation solutions both schedulers.