Page 154 - DCAP103_Principle of operating system

Deepak Mehta, Lovely Professional University Unit 5: Memory Management

Unit 5: Memory Management Notes

CONTENTS
Objectives
Introduction
5.1 Address Binding
5.2 Logical versus Physical-Address Space
5.3 Swapping
5.4 Contiguous Memory Allocation
5.5 Paging
5.5.1 Basic Method
5.5.2 Hardware Support
5.5.3 Protection
5.5.4 Hierarchical Paging
5.5.5 Shared Pages
5.6 Segmentation
5.6.1 Segmentation with Paging
5.7 Virtual Memory
5.7.1 Paging and Swapping
5.7.2 Demand Paging — Lazy Evaluation
5.7.3 Swapping and Paging Algorithms
5.7.4 FIFO — First In First Out
5.7.5 Second Chance
5.7.6 LRU — Least Recently Used
5.8 Thrashing
5.9 Demand Paging
5.9.1 Basic Concepts
5.9.2 Performance of Demand Paging
5.10 Overview of Page Replacement
5.10.1 Basic Scheme
5.10.2 FIFO Page Replacement
5.10.3 Optimal Page Replacement
5.10.4 Page-replacement Algorithm
5.11 LRU Page Replacement
5.11.1 Counters
5.11.2 Stack
5.11.3 LRU Approximation Page Replacement
5.11.4 Additional-Reference-Bits Algorithm
5.11.5 Second-chance Algorithm
5.11.6 Enhanced Second-chance Algorithm
5.11.7 Counting-based Page Replacement
5.11.8 Page-buffering Algorithm

LOVELY PROFESSIONAL UNIVERSITY 147