Movatterモバイル変換


[0]ホーム

URL:


Damian T. Gordon, profile picture
Uploaded byDamian T. Gordon
PPTX, PDF4,931 views

Operating Systems: Virtual Memory

The document discusses how modern operating systems use paging to manage memory. Programs are divided into chunks called pages which are loaded into frames of main memory as needed. This allows more programs to reside partially in memory than would fit entirely, through demand paging which loads only currently used parts of a program. This creates the illusion of larger memory usage via virtual memory.

Related topics:
OS

Embed presentation

Downloaded 186 times
Damian Gordon
HARD DISK(MAINMEMORY)(SECONDARYMEMORY)2CACHE 1
HARD DISK(MAINMEMORY)(SECONDARYMEMORY)2CACHE 1
HARD DISK(MAINMEMORY)(SECONDARYMEMORY)2CACHE 1Computerprogramsare storedhere
HARD DISK(MAINMEMORY)(SECONDARYMEMORY)2CACHE 1Computerprogramsare storedhereUntil theyneed tobeexecuted
HARD DISK(MAINMEMORY)(SECONDARYMEMORY)2CACHE 1Computerprogramsare storedhereUntil theyneed tobeexecutedThen theyare movedto here
 In modern operating systems, before aprogram is loaded into main memory, it isdivided into chunks, called PAGES.
 In modern operating systems, before aprogram is loaded into main memory, it isdivided into chunks, called PAGES.Program 3
 In modern operating systems, before aprogram is loaded into main memory, it isdivided into chunks, called PAGES.Program 3Page 2Page 3Page 4Page 5Page 6Page 1Page 7
 Each PAGE is loaded into memory locationscalled PAGE FRAMES.
 Each PAGE is loaded into memory locationscalled PAGE FRAMES.200KavailableMAINMEMORY
 Each PAGE is loaded into memory locationscalled PAGE FRAMES.MAINMEMORYPage Frame 1Page Frame 2Page Frame 3Page Frame 4Page Frame 5Page Frame 6Page Frame 7Page Frame 8Page Frame 9Page Frame 10200Kavailable
 If the PAGES are the exactsame size as the PAGEFRAMES (and the samesize as the disk sectors),this scheme works verywell. MAINMEMORYPage Frame 1Page Frame 2Page Frame 3Page Frame 4Page Frame 5Page Frame 6Page Frame 7Page Frame 8Page Frame 9Page Frame 10200Kavailable
 The Memory Manager prepares a program forexecution by doing the following:1. Determine the number of pages in the program2. Locate enough empty page frames in mainmemory3. Load all the program’s pages into themThe empty page frame does not have to becontagious.
 Consider a program that 350 bytes, and thepage size is 100 bytes.
 Consider a program that 350 bytes, and thepage size is 100 bytes.Program 4:350 bytes
 Consider a program that 350 bytes, and thepage size is 100 bytes.Program 4:350 bytesPage 0
Program 4:350 bytes Consider a program that 350 bytes, and thepage size is 100 bytes.Page 0Page 1
Program 4:350 bytes Consider a program that 350 bytes, and thepage size is 100 bytes.Page 0Page 1Page 2
 Consider a program that 350 bytes, and thepage size is 100 bytes.Page 3Program 4:350 bytesPage 0Page 1Page 2
 Consider a program that 350 bytes, and thepage size is 100 bytes.MainMemoryPage 3Program 4:350 bytesPage 0Page 1Page 2
 Consider a program that 350 bytes, and thepage size is 100 bytes.MainMemoryOperatingSystemPage 3Program 4:350 bytesPage 0Page 1Page 2
 Consider a program that 350 bytes, and thepage size is 100 bytes.MainMemoryOperatingSystemPage 2Page 0Page 1Page 3Page 3Program 4:350 bytesPage 0Page 1Page 2
 Consider a program that 350 bytes, and thepage size is 100 bytes.MainMemoryOperatingSystemPage 2Page 0Page 1Page 3A little bit ofinternalfragmentationPage 3Program 4:350 bytesPage 0Page 1Page 2
 A useful extension to the notion of PAGING isDEMAND PAGING. Demand Paging introduces the notion thatyou don’t have to load the whole programinto memory, just part of it. Because not all of the program needs to be inmemory at the same time.
 This means that lots of programs can be runat the same time, and there is an illusion of asignificantly larger amount of memory thanwith regular paging.
 To make this work, pages have to be movedvery quickly from Secondary Storage to MainMemory and back again (this is called“swapping”).
 This leads to the concept of VIRTUALMEMORY The size of main memory appears muchlarger than the actual size, since manyprograms can appear to be fully loaded intomain memory at the same time, when inactual fact, only part of many programs areloaded into main memory.

Recommended

PPT
Virtual memory
PPT
Virtual memory
PPTX
Virtual Memory
PPT
Virtual memory
PPTX
Computer architecture virtual memory
PPT
Virtual memory
PPTX
Memory Technology
PDF
Memory Organization of a Computer System
PPTX
Virtual memory management in Operating System
PPTX
Memory Management in OS
PPTX
Demand paging
PPTX
Memory management in operating system | Paging | Virtual memory
PPTX
Segmentation in operating systems
PDF
Memory management
PPT
Memory management
PPT
Memory Management in OS
PPTX
Operations on Processes and Cooperating processes
PPTX
Operating system deign and implementation
PPTX
Demand paging
PPT
Scheduling algorithms
PPT
Contiguous Memory Allocation.ppt
PPTX
CPU Scheduling in OS Presentation
PPTX
Operating system memory management
PPTX
Segmentation in Operating Systems.
PPTX
Page replacement algorithms
PPTX
Operating system - Process and its concepts
PPT
Disk scheduling
PPTX
OS disk structure (1).pptx
PPTX
Operating Systems: Linux in Detail
PPTX
Operating Systems: File Management

More Related Content

PPT
Virtual memory
PPT
Virtual memory
PPTX
Virtual Memory
PPT
Virtual memory
PPTX
Computer architecture virtual memory
PPT
Virtual memory
PPTX
Memory Technology
PDF
Memory Organization of a Computer System
Virtual memory
Virtual memory
Virtual Memory
Virtual memory
Computer architecture virtual memory
Virtual memory
Memory Technology
Memory Organization of a Computer System

What's hot

PPTX
Virtual memory management in Operating System
PPTX
Memory Management in OS
PPTX
Demand paging
PPTX
Memory management in operating system | Paging | Virtual memory
PPTX
Segmentation in operating systems
PDF
Memory management
PPT
Memory management
PPT
Memory Management in OS
PPTX
Operations on Processes and Cooperating processes
PPTX
Operating system deign and implementation
PPTX
Demand paging
PPT
Scheduling algorithms
PPT
Contiguous Memory Allocation.ppt
PPTX
CPU Scheduling in OS Presentation
PPTX
Operating system memory management
PPTX
Segmentation in Operating Systems.
PPTX
Page replacement algorithms
PPTX
Operating system - Process and its concepts
PPT
Disk scheduling
PPTX
OS disk structure (1).pptx
Virtual memory management in Operating System
Memory Management in OS
Demand paging
Memory management in operating system | Paging | Virtual memory
Segmentation in operating systems
Memory management
Memory management
Memory Management in OS
Operations on Processes and Cooperating processes
Operating system deign and implementation
Demand paging
Scheduling algorithms
Contiguous Memory Allocation.ppt
CPU Scheduling in OS Presentation
Operating system memory management
Segmentation in Operating Systems.
Page replacement algorithms
Operating system - Process and its concepts
Disk scheduling
OS disk structure (1).pptx

Viewers also liked

PPTX
Operating Systems: Linux in Detail
PPTX
Operating Systems: File Management
PPTX
Operating Systems: Versions of Linux
PPTX
Operating Systems: Device Management
PPTX
Introduction to Pseudocode
PPTX
The Scrum Model
Operating Systems: Linux in Detail
Operating Systems: File Management
Operating Systems: Versions of Linux
Operating Systems: Device Management
Introduction to Pseudocode
The Scrum Model

Similar to Operating Systems: Virtual Memory

PPTX
Operating Systems - Virtual Memory
PPT
Unit 5 Memory management System in OS.ppt
PPTX
Unit 5 Memory management in OS Unit 5 Memory management in OS
PPTX
Main Memory Management in Operating System
PPTX
Abhaycavirtual memory and the pagehit.pptx
PPT
OPERATING SYSTEM IMPORTANT NOTES_UNIT-4.ppt
PPTX
Os unit 3
PPT
NOV11 virtual memory_Engineering_CSE.ppt
PPT
NOV11 virtual memory computer organization..ppt
PPTX
Os unit 2
PPTX
Operating Systems: Memory Management
PPTX
chapter 2 memory and process management
PPT
Memory comp
PPTX
coafinal1-copy-150430204758-conversion-gate01.pptx
PPT
Chapter 09 - Virtual Memory.ppt
PPTX
Module 4 - Operating Systems presentation four
PPT
Cache memory
PPT
CHAPTE employs more at document and create
PPT
virtual memory.ppt
Operating Systems - Virtual Memory
Unit 5 Memory management System in OS.ppt
Unit 5 Memory management in OS Unit 5 Memory management in OS
Main Memory Management in Operating System
Abhaycavirtual memory and the pagehit.pptx
OPERATING SYSTEM IMPORTANT NOTES_UNIT-4.ppt
Os unit 3
NOV11 virtual memory_Engineering_CSE.ppt
NOV11 virtual memory computer organization..ppt
Os unit 2
Operating Systems: Memory Management
chapter 2 memory and process management
Memory comp
coafinal1-copy-150430204758-conversion-gate01.pptx
Chapter 09 - Virtual Memory.ppt
Module 4 - Operating Systems presentation four
Cache memory
CHAPTE employs more at document and create
virtual memory.ppt

More from Damian T. Gordon

PPTX
Introduction to Prompts and Prompt Engineering
PPTX
Introduction to Vibe Coding and Vibe Engineering
PPTX
TRIZ: Theory of Inventive Problem Solving
PPTX
Some Ethical Considerations of AI and GenAI
PPTX
Some Common Errors that Generative AI Produces
PPTX
The Use of Data and Datasets in Data Science
PPTX
A History of Different Versions of Microsoft Windows
PPTX
Writing an Abstract: A Question-based Approach
PPTX
Using GenAI for Universal Design for Learning
DOC
A CheckSheet for Inclusive Software Design
PPTX
A History of Versions of the Apple MacOS
PPTX
68 Ways that Data Science and AI can help address the UN Sustainability Goals
PPTX
Copyright and Creative Commons Considerations
PPTX
Exam Preparation: Some Ideas and Suggestions
PPTX
Studying and Notetaking: Some Suggestions
PPTX
The Growth Mindset: Explanations and Activities
PPTX
Hyperparameter Tuning in Neural Networks
PPTX
Early 20th Century Modern Art: Movements and Artists
PPTX
An Introduction to Generative Artificial Intelligence
PPTX
An Introduction to Green Computing with a fun quiz.
Introduction to Prompts and Prompt Engineering
Introduction to Vibe Coding and Vibe Engineering
TRIZ: Theory of Inventive Problem Solving
Some Ethical Considerations of AI and GenAI
Some Common Errors that Generative AI Produces
The Use of Data and Datasets in Data Science
A History of Different Versions of Microsoft Windows
Writing an Abstract: A Question-based Approach
Using GenAI for Universal Design for Learning
A CheckSheet for Inclusive Software Design
A History of Versions of the Apple MacOS
68 Ways that Data Science and AI can help address the UN Sustainability Goals
Copyright and Creative Commons Considerations
Exam Preparation: Some Ideas and Suggestions
Studying and Notetaking: Some Suggestions
The Growth Mindset: Explanations and Activities
Hyperparameter Tuning in Neural Networks
Early 20th Century Modern Art: Movements and Artists
An Introduction to Generative Artificial Intelligence
An Introduction to Green Computing with a fun quiz.

Recently uploaded

PDF
Cattolica University - Lab Generative and Agentic AI - Mario Bencivinni
PPTX
Organize order into course in Odoo 18.2 _ Odoo 19
PDF
Hybrid Electric Vehicles Descriptive Questions
PPTX
Time Series Analysis - Meaning, Definition, Components and Application
PPTX
Elderly in India: The Changing Scenario.pptx
 
PDF
Conferencia de Abertura_Virgilio Almeida.pdf
PPTX
Chapter 3. Pharmaceutical Aids (pharmaceutics)
PDF
Unit 1- Basics of Management Cha. of Magmt
PDF
Risk Management and Regulatory Compliance - by Ms. Oceana Wong
PDF
DEFINITION OF COMMUNITY Sociology. .pdf
PDF
IMPATT Diodes: Theory, Construction, Operation, and Microwave Applications"
PPTX
Introduction to Beauty Care and Wellness Services.pptx-day fcs 3rd quarter tl...
PPTX
Finals - History and Geography Quiz - Around the World in 80 Questions - IITK
PPTX
G-Protein-Coupled Receptors (GPCRs): Structure, Mechanism, and Functions
PPTX
Time Series Analysis - Least Square Method Fitting a Linear Trend Equation
PDF
Photoperiod Classification of Vegetable Plants.pdf
PDF
Integrated Circuits: Lithography Techniques - Fundamentals and Advanced Metho...
PDF
বাংলাদেশ অর্থনৈতিক সমীক্ষা - ২০২৫ with Bookmark.pdf
PDF
Digital Electronics – Registers and Their Applications
PDF
The invasion of Alexander of Macedonia in India
Cattolica University - Lab Generative and Agentic AI - Mario Bencivinni
Organize order into course in Odoo 18.2 _ Odoo 19
Hybrid Electric Vehicles Descriptive Questions
Time Series Analysis - Meaning, Definition, Components and Application
Elderly in India: The Changing Scenario.pptx
 
Conferencia de Abertura_Virgilio Almeida.pdf
Chapter 3. Pharmaceutical Aids (pharmaceutics)
Unit 1- Basics of Management Cha. of Magmt
Risk Management and Regulatory Compliance - by Ms. Oceana Wong
DEFINITION OF COMMUNITY Sociology. .pdf
IMPATT Diodes: Theory, Construction, Operation, and Microwave Applications"
Introduction to Beauty Care and Wellness Services.pptx-day fcs 3rd quarter tl...
Finals - History and Geography Quiz - Around the World in 80 Questions - IITK
G-Protein-Coupled Receptors (GPCRs): Structure, Mechanism, and Functions
Time Series Analysis - Least Square Method Fitting a Linear Trend Equation
Photoperiod Classification of Vegetable Plants.pdf
Integrated Circuits: Lithography Techniques - Fundamentals and Advanced Metho...
বাংলাদেশ অর্থনৈতিক সমীক্ষা - ২০২৫ with Bookmark.pdf
Digital Electronics – Registers and Their Applications
The invasion of Alexander of Macedonia in India

Operating Systems: Virtual Memory

  • 1.
  • 2.
  • 3.
  • 4.
  • 5.
  • 6.
    HARD DISK(MAINMEMORY)(SECONDARYMEMORY)2CACHE 1ComputerprogramsarestoredhereUntil theyneed tobeexecutedThen theyare movedto here
  • 7.
     In modernoperating systems, before aprogram is loaded into main memory, it isdivided into chunks, called PAGES.
  • 8.
     In modernoperating systems, before aprogram is loaded into main memory, it isdivided into chunks, called PAGES.Program 3
  • 9.
     In modernoperating systems, before aprogram is loaded into main memory, it isdivided into chunks, called PAGES.Program 3Page 2Page 3Page 4Page 5Page 6Page 1Page 7
  • 10.
     Each PAGEis loaded into memory locationscalled PAGE FRAMES.
  • 11.
     Each PAGEis loaded into memory locationscalled PAGE FRAMES.200KavailableMAINMEMORY
  • 12.
     Each PAGEis loaded into memory locationscalled PAGE FRAMES.MAINMEMORYPage Frame 1Page Frame 2Page Frame 3Page Frame 4Page Frame 5Page Frame 6Page Frame 7Page Frame 8Page Frame 9Page Frame 10200Kavailable
  • 13.
     If thePAGES are the exactsame size as the PAGEFRAMES (and the samesize as the disk sectors),this scheme works verywell. MAINMEMORYPage Frame 1Page Frame 2Page Frame 3Page Frame 4Page Frame 5Page Frame 6Page Frame 7Page Frame 8Page Frame 9Page Frame 10200Kavailable
  • 14.
     The MemoryManager prepares a program forexecution by doing the following:1. Determine the number of pages in the program2. Locate enough empty page frames in mainmemory3. Load all the program’s pages into themThe empty page frame does not have to becontagious.
  • 15.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.
  • 16.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.Program 4:350 bytes
  • 17.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.Program 4:350 bytesPage 0
  • 18.
    Program 4:350 bytesConsider a program that 350 bytes, and thepage size is 100 bytes.Page 0Page 1
  • 19.
    Program 4:350 bytesConsider a program that 350 bytes, and thepage size is 100 bytes.Page 0Page 1Page 2
  • 20.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.Page 3Program 4:350 bytesPage 0Page 1Page 2
  • 21.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.MainMemoryPage 3Program 4:350 bytesPage 0Page 1Page 2
  • 22.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.MainMemoryOperatingSystemPage 3Program 4:350 bytesPage 0Page 1Page 2
  • 23.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.MainMemoryOperatingSystemPage 2Page 0Page 1Page 3Page 3Program 4:350 bytesPage 0Page 1Page 2
  • 24.
     Consider aprogram that 350 bytes, and thepage size is 100 bytes.MainMemoryOperatingSystemPage 2Page 0Page 1Page 3A little bit ofinternalfragmentationPage 3Program 4:350 bytesPage 0Page 1Page 2
  • 25.
     A usefulextension to the notion of PAGING isDEMAND PAGING. Demand Paging introduces the notion thatyou don’t have to load the whole programinto memory, just part of it. Because not all of the program needs to be inmemory at the same time.
  • 26.
     This meansthat lots of programs can be runat the same time, and there is an illusion of asignificantly larger amount of memory thanwith regular paging.
  • 27.
     To makethis work, pages have to be movedvery quickly from Secondary Storage to MainMemory and back again (this is called“swapping”).
  • 28.
     This leadsto the concept of VIRTUALMEMORY The size of main memory appears muchlarger than the actual size, since manyprograms can appear to be fully loaded intomain memory at the same time, when inactual fact, only part of many programs areloaded into main memory.

[8]ページ先頭

©2009-2025 Movatter.jp