On Linux starvation of CPU-bound processes in the presence of network I/O
نویسندگان
چکیده
Computer Engineering Department, Khalifa University of Science Technology and Research (KUSTAR), Sharjah, United Arab Emirates Department of Information and Computer Science, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia Department of Computer Science and Information Technology, University of the District of Columbia, Washington, DC 20008, USA Department of Communications and Information Engineering, University of Murcia, Murcia 30011, Spain Hewlett-Packard Labs, Cloud and Security Lab, Bristol BS34 8QZ, UK
منابع مشابه
Mitigating starvation of Linux CPU-bound processes in the presence of network I/O
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...
متن کاملWindow-Constrained Process Scheduling for Linux Systems
This paper describes our experience using Dynamic Window-Constrained Scheduling (DWCS) [13, 14, 12, 11] to schedule processes (and threads) on available CPUs in a Linux system. We describe the implementation of a kernel-loadable module that replaces the default Linux scheduler. Each process scheduled using DWCS has a request period of T time units and a ‘window-constraint’, x/y. The end of one ...
متن کاملOn Intelligent Mitigation of Process Starvation In Multilevel Feedback Queue Scheduling
CPU time-share process schedulers for computer operating systems have existed since Corbato published his paper on the Compatible Time Sharing System in 1962 [8]. With this new type of scheduler came the need to effectively divide CPU time between N processes, where N could be 2 or more processes. Modern time-sharing process schedulers which have been developed in the decades since have been de...
متن کاملScheduling of Interactive Processes
When we work with computers, most of the workload we generate is of an interactive nature. Our interactions with the computer are in the form of a conversation — we type something, the computers replies and so on. Applications that work in this manner are considered interactive. Since the birth of the UNIX operating system in the early 1970s, operating systems’ task schedulers regard interactiv...
متن کاملHuman-Centered Scheduling of Interactive and Multimedia Applications on a Loaded Desktop
Desktop operating systems such as Windows or Linux base scheduling decisions on the CPU usage of competing processes. Processes that exhibit low CPU usage are given priority, under the assumption that they are interactive and spend most of their time waiting for user input. However, this doesn’t work for modern multimedia applications, which require significant CPU resources, so playing a DVD m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Electrical Engineering
دوره 37 شماره
صفحات -
تاریخ انتشار 2011