Journal Article

Medium-Term Scheduler as a Solution for the Thrashing Effect†

Moses Reuven and Yair Wiseman

in The Computer Journal

Published on behalf of British Computer Society

Volume 49, issue 3, pages 297-309
ISSN: 0010-4620
Published online February 2006 | e-ISSN: 1460-2067 | DOI: http://dx.doi.org/10.1093/comjnl/bxl001
Medium-Term Scheduler as a Solution for the Thrashing Effect†

Show Summary Details

Preview

We suggest a method for minimizing the paging on a system with a very heavy memory usage. Sometimes there are processes with active memory allocations that should be in the physical memory, but their total size exceeds the physical memory range. In such cases, the operating system starts swapping pages in and out of the memory on every context switch. We minimize this thrashing by splitting the processes into a number of bins, using Bin Packing approximation algorithms. We modify the scheduler to have two levels of scheduling—medium-term scheduling and short-term scheduling. The medium-term scheduler switches the bins in a Round-Robin manner, whereas the short-term scheduler runs the standard Linux scheduler among the processes in each bin. We show that this feature does not impose modifications on the shared memory maintenance. In addition, we show how to adjust the new scheduler to fit some elements of the original scheduler like priority and real-time privileges. Experimental results show significant improvement on heavily loaded memories. The code of this project is free and can be found in .

Keywords: Scheduling; allocation/deallocation strategies; swapping; virtual memory; process management

Journal Article.  7208 words.  Illustrated.

Subjects: Computer Science

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.