Reducing the thrashing effect using bin packing

Moses Reuven, Yair Wiseman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 need to be in the physical memory, and their total size exceeds the physical memory size. In these cases the operating system will start 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 change the scheduler to have two levels of scheduling - mediumterm scheduling and short-term scheduling. The mediumterm scheduler switches the bins in a Round-Robin manner, while the short-term scheduler runs the standard Linux scheduler among the processes in each bin. Experimental results show significant improvement on heavily loaded memories. The code of this project is free and can be found in: http://www.cs.biu.ac.il/~reubenm.

Original languageEnglish
Title of host publicationProceedings of the Fifth IASTED International Conference on Modelling, Simulation, and Optimization
Pages5-10
Number of pages6
StatePublished - 2005
Externally publishedYes
Event5th IASTED International Conference on Modelling, Simulation, and Optimization - Oranjestad, Aruba
Duration: 29 Aug 200531 Aug 2005

Publication series

NameProceedings of the IASTED International Conference on Modelling, Simulation, and Optimization
Volume2005

Conference

Conference5th IASTED International Conference on Modelling, Simulation, and Optimization
Country/TerritoryAruba
CityOranjestad
Period29/08/0531/08/05

Keywords

  • Bin-packing
  • Kernel manipulation
  • Thrashing

Fingerprint

Dive into the research topics of 'Reducing the thrashing effect using bin packing'. Together they form a unique fingerprint.

Cite this