Welcome to the InfoSci Platform
Alleviating the Thrashing by Adding Medium- Term Scheduler

Alleviating the Thrashing by Adding Medium- Term Scheduler

Moses Reuven, Yair Wiseman
Copyright: © 2010 |Pages: 19
ISBN13: 9781605668505|ISBN10: 1605668508|ISBN13 Softcover: 9781616923839|EISBN13: 9781605668512
DOI: 10.4018/978-1-60566-850-5.ch007
Cite Chapter Cite Chapter

MLA

Reuven, Moses, and Yair Wiseman. "Alleviating the Thrashing by Adding Medium- Term Scheduler." Advanced Operating Systems and Kernel Applications: Techniques and Technologies, edited by Yair Wiseman and Song Jiang, IGI Global, 2010, pp. 118-136. https://doi.org/10.4018/978-1-60566-850-5.ch007

APA

Reuven, M. & Wiseman, Y. (2010). Alleviating the Thrashing by Adding Medium- Term Scheduler. In Y. Wiseman & S. Jiang (Eds.), Advanced Operating Systems and Kernel Applications: Techniques and Technologies (pp. 118-136). IGI Global. https://doi.org/10.4018/978-1-60566-850-5.ch007

Chicago

Reuven, Moses, and Yair Wiseman. "Alleviating the Thrashing by Adding Medium- Term Scheduler." In Advanced Operating Systems and Kernel Applications: Techniques and Technologies, edited by Yair Wiseman and Song Jiang, 118-136. Hershey, PA: IGI Global, 2010. https://doi.org/10.4018/978-1-60566-850-5.ch007

Export Reference

Mendeley
Favorite

Abstract

A technique for minimizing the paging on a system with a very heavy memory usage is proposed. When there are processes with active memory allocations that should be in the physical memory, but their accumulated size exceeds the physical memory capacity. In such cases, the operating system begins swapping pages in and out the memory on every context switch. The authors lessen this thrashing by placing the processes into several bins, using Bin Packing approximation algorithms. They amend the scheduler to maintain two levels of scheduling - medium-term scheduling and short-term scheduling. The mediumterm scheduler switches the bins in a Round-Robin manner, whereas the short-term scheduler uses the standard Linux scheduler to schedule the processes in each bin. The authors prove that this feature does not necessitate adjustments in the shared memory maintenance. In addition, they explain how to modify the new scheduler to be compatible with some elements of the original scheduler like priority and realtime privileges. Experimental results show substantial improvement on very loaded memories.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.