Mitigating starvation of Linux CPU-bound processes in the presence of network I/O |
| |
| Authors: | K Salah A Manea S Zeadally Jose M Alcaraz Calero |
| |
| Affiliation: | 1. Computer Engineering Department, Khalifa University of Science Technology and Research (KUSTAR), Sharjah, United Arab Emirates;2. Department of Computer Science, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia;3. Department of Computer Science and IT, University of the District of Columbia, Washington, DC, United States;4. Department of Communications and Information Engineering, University of Murcia, Murcia 30011, Spain;5. Hewlett-Packard Labs, Cloud and Security Lab, Bristol BS34 8QZ, UK;1. Key Laboratory of New Technology for Construction of Cities in Mountain Area (Ministry of Education), Chongqing University, Chongqing 400045, China;2. Key Lab of Structures Dynamic Behavior and Control (Harbin Institute of Technology), Ministry of Education, Harbin 150090, China;3. School of Civil Engineering, Chongqing University, Chongqing 400045, China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
