Operating System Concepts-3

Master the basics of Operating System memory management, virtual memory, page replacement, thrashing from scratch.

What you'll learn
Memory management terminology
Where do memory addresses come from?
What are the required memory management properties?
What are some simple memory allocation schemes?
What is fragmentation? (Internal, external fragmentation.)
What is paging?
What is the key idea behind paging?
How paging works?
How is address translation done with paging?
How does paging hardware work?
How is memory address translated by the paging hardware?
How do memory management systems perform address translation without division?
How to make paging efficient?
What is TLB cache?
How does TLB cache work?
What are the performance implications of a TLB cache?
How is the main memory initialized when a process is started?
How context switches are performed in presence of paging?
How does paging facilitate memory sharing?
What is demand paging?
How does demand paging work?
When to load a page in demand paging?
How is demand paging implemented?
What is swap space?
What are the performance implications of demand paging?
How is TLB cache updated with demand paging?
What are page replacement algorithms?
What is FIFO page replacement?
What is MIN page replacement?
What is Random page replacement?
What is LRU page replacement?
What is Belady's anomaly?
What is thrashing?
How to limit thrashing?
What is working set?
Requirements
No previous knowledge about operating systems needed. Everything you need to know about the topics will be covered.
Description
Ace operating systems (OS) memory management, paging, virtual memory, page replacement, thrashing, working set questions in competitive exams, job interviews, and OS course exams.Do you know: How the OS presents an illusion of infinite memory to users? How can the OS execute processes much bigger than the RAM (main memory)? Where do memory addresses come from? How does OS keep several processes inside the RAM for execution? How OS makes room for new processes when the RAM is full? What happens if there are too many processes in the RAM? Learn the explanations to these and many more intriguing questions in this course!Specifically, the course will cover the following in detail.Memory management terminologyWhere do memory addresses come from?What are the required memory management properties?What are some simple memory allocation schemes?What is fragmentation?What is internal fragmentation?What is external fragmentation?What is paging?What is the key idea behind paging?How paging works?How is address translation done with paging?How does paging hardware work?How is memory address translated by the paging hardware?How do memory management systems perform address translation without division?How to make paging efficient?What is TLB cache?How does TLB cache work?What are the performance implications of a TLB cache?How is the main memory initialized when a process is started?How context switches are performed in presence of paging?How does paging facilitate memory sharing?What is demand paging?How does demand paging work?When to load a page in demand paging?How is demand paging implemented?What is swap space?What are the performance implications of demand paging?How is TLB cache updated with demand paging?What are page replacement algorithms?What is FIFO page replacement?What is MIN page replacement?What is Random page replacement?What is LRU page replacement?What is Belady's anomaly?What is thrashing?How to limit thrashing?What is working set?30 day money back guaranteed by Udemy.Wisdom scholarships. If you are interested in taking one of our courses but cannot purchase it, you can apply for a scholarship to enroll. Learn more about the application process at my website.

Overview

Section 1: Introduction

Lecture 1 Memory management terminology

Lecture 2 Where do addresses come from?

Lecture 3 Required memory management properties

Lecture 4 Simple memory allocation schemes

Lecture 5 Memory allocation and fragmentation

Lecture 6 Fragmentation heuristics

Section 2: Paging

Lecture 7 Paging idea

Lecture 8 Paging - motivation and features I

Lecture 9 Paging - motivation and features II

Lecture 10 Paging - example

Lecture 11 Paging - address translation

Lecture 12 Paging hardware

Lecture 13 Paging hardware - address translation

Lecture 14 Paging hardware - practical details

Section 3: Address translation

Lecture 15 Address translation example I

Lecture 16 Address translation example II

Lecture 17 Address translation without division

Section 4: How to make paging efficient?

Lecture 18 Making paging efficient

Lecture 19 TLB cache key idea

Lecture 20 TLB cache in action I

Lecture 21 TLB cache in action II

Lecture 22 Performance cost of using TLB cache

Section 5: Processes and paging

Lecture 23 Initializing memory when starting a process

Lecture 24 Context switch in presence of paging

Lecture 25 Memory sharing with paging

Section 6: Demand paging

Lecture 26 Demand paging key ideas

Lecture 27 Demand paging details

Lecture 28 Demand paging example

Lecture 29 When to load a page I?

Lecture 30 When to load a page II?

Lecture 31 Implementation of demand paging

Lecture 32 Swap space

Lecture 33 Demand paging performance

Lecture 34 Demand paging - updating the TLB

Section 7: Page replacement algorithms

Lecture 35 Page replacement algorithms - FIFO

Lecture 36 Page replacement algorithms - MIN

Lecture 37 Page replacement algorithms - Random

Lecture 38 Page replacement algorithms - LRU

Lecture 39 FIFO page replacement example

Lecture 40 MIN page replacement example

Lecture 41 LRU page replacement example

Section 8: Unusual scenarios for page replacement algorithms

Lecture 42 LRU page replacement bad scenario

Lecture 43 FIFO page replacement unexpected behavior I

Lecture 44 FIFO page replacement unexpected behavior II

Lecture 45 Adding memory with LRU page replacement

Section 9: Thrashing

Lecture 46 Thrashing

Lecture 47 How to limit thrashing?

Lecture 48 Working set example

Lecture 49 Using page fault rate to prevent thrashing

Lecture 50 Demand paging summary

Anyone interested in learning about operating systems in modern computers could benefit from this course.,Computer science undergraduate students taking an operating systems course could benefit from the course.