SlideShare ist ein Scribd-Unternehmen logo
1 von 13
VIRTUAL MEMORY
Present by: -
Ravisha Sethi
CONTENTS

 virtual memory
 Needs of virtual memory

 Importance of virtual memory

 Advantage of virtual memory

 Disadvantage of virtual memory

 Address space & memory space

 Page replacement algorithms

 FIFO

 LRU

 OPT
VIRTUAL MEMORY
   Virtual memory is a common part of operating system on desktop
    computers.
   The term virtual memory refers to something which appears to be present
    but actually it is not.
   The virtual memory technique allows users to use more memory for a
    program than the real memory of a computer.

                                               present
                           Mapper
   CPU           (1)                           (3) Page
                                 (4)           frame + x
 Logical               Not present
                                 Page
 page + x
                                 frames

 Virtual                                              (5)
 address                                                      Page frames

Secondary
storage
NEED OF VIRTUAL MEMORY
 Virtual memory is a imaginary memory which we are
  assuming. If we have a material that exceed your
  memory at that time we need to use the concept of virtual
  memory.
 virtual memory is temporary memory which is used
  along with the ram of the system.
IMPORTANCE OF VIRTUAL MEMORY
 When your computer runs out of physical memory it
  writes what it needs to remember to the hard disc in a
  swap file as virtual memory.
 If a computer running Windows requires more
  memory/RAM then there is installed in the system to run
  a program, etc, it uses a small section of the hard drive
  for this purpose
ADDRESS SPACE AND MEMORY SPACE
 Virtual memory is the address used by the programmer
  and the set of such addresses is called address space.
 An address in main memory is called a physical address.

 The set of such locations in main memory is called the
  memory space.
 Thus the memory space consist of the actual main
  memory locations directly addressable for processing.
PAGE REPLACEMENT ALGORITHMS
 In a computer operating system that uses paging for
  virtual memory management, page replacement
  algorithm decide which memory pages to page out.
  When a page of memory need to be allocated.
 FIFO (first in first out)

 LRU (Least Recently used)

 OPT (Optimal)
FIFO
   First in first out is very easy to implement.
   The fifo algorithm select the page for replacement
   that has been in memory the longest time.

time 1     2     3     4     5      6    7      8    9      10     11     12
page P2    p3    p2    p1    p5    p2    p4    p5    p3     p2     p5     p2

     p2*   p2*   p2*   p2*   P5    p5    p5*   p5*    P3    P3      P3    P3*

           p3    p3    P3    p3*   P2    P2    P2     p2*   P2*     P5    P5
                                                      p4
                       P1    p1    P1*   p4    p4           p4      P4*   p2

                 hit                           hit           hit
LRU
 The least recently used page replacement algorithm
  keeps track page uses over a short period of time.
 The LRU algorithm can be implemented by associating a
  counter with every page that is n main memory.


time 1    2     3     4     5      6    7      8     9      10    11     12
pag P2    p3    p2    p1    p5    p2    p4    p5     p3     p2    p5     p2
e
    p2*   p2*   P2    P2    p2*   P2    P2    p2*     P3    P3     P3*   P3*

          p3    p3*   p3*   P5    P5    p5*   P5      P5    P5*    P5    P5
                                                      p4*
                      P1    P1    P1*   p4    P4            P2     P2    p2

                hit               hit          hit                 hit   hit
OPT
   The optimal policy selects that page for replacement for
    which the time to the next reference is longest.
   This algorithm result is fewest number of page faults.


time   1    2    3     4    5     6    7     8     9      10   11     12
page P2     p3   p2    p1   p5   p2    p4   p5     p3     p2   p5     p2

       p2   p2   P2    P2   P2   P2    P4   P4      P4    P2    P2    P2

            p3   p3    p3   P3   P3    P3   P3      P3    P3    P3    P3
                                                    p5
                       P1   P5   P5    p5   P5            P5    P5    P5

                 hit             hit         hit    hit         hit   hit
ADVANTAGES OF VIRTUAL MEMORY
 Allows processes whose aggregate memory requirement
  is greater than the amount of physical memory, as
  infrequently used pages can reside on the disk.
 Virtual memory allows speed gain when only a particular
  segment of the program is required for the execution of
  the program.
 This concept is very helpful in implementing
  multiprogramming environment.
DISADVANTAGES OF VIRTUAL MEMORY
 Applications run slower if the system is using virtual
  memory.
 It Takes more time to switch between applications.

 Less hard drive space for your use.

 It reduces system stability.
Virtual memory ppt

Weitere ähnliche Inhalte

Was ist angesagt?

Inter Process Communication Presentation[1]
Inter Process Communication Presentation[1]Inter Process Communication Presentation[1]
Inter Process Communication Presentation[1]
Ravindra Raju Kolahalam
 
Cache memory
Cache memoryCache memory
Cache memory
Anuj Modi
 
Page replacement algorithms
Page replacement algorithmsPage replacement algorithms
Page replacement algorithms
Piyush Rochwani
 

Was ist angesagt? (20)

Threads (operating System)
Threads (operating System)Threads (operating System)
Threads (operating System)
 
Os Swapping, Paging, Segmentation and Virtual Memory
Os Swapping, Paging, Segmentation and Virtual MemoryOs Swapping, Paging, Segmentation and Virtual Memory
Os Swapping, Paging, Segmentation and Virtual Memory
 
Virtual Memory
Virtual MemoryVirtual Memory
Virtual Memory
 
Architecture of operating system
Architecture of operating systemArchitecture of operating system
Architecture of operating system
 
operating system structure
operating system structureoperating system structure
operating system structure
 
Cache memory
Cache memoryCache memory
Cache memory
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
 
Demand paging
Demand pagingDemand paging
Demand paging
 
Computer Organization and Architecture.
Computer Organization and Architecture.Computer Organization and Architecture.
Computer Organization and Architecture.
 
Scheduling algorithms
Scheduling algorithmsScheduling algorithms
Scheduling algorithms
 
Memory Management in OS
Memory Management in OSMemory Management in OS
Memory Management in OS
 
Interrupts and types of interrupts
Interrupts and types of interruptsInterrupts and types of interrupts
Interrupts and types of interrupts
 
Parallel processing
Parallel processingParallel processing
Parallel processing
 
Inter Process Communication Presentation[1]
Inter Process Communication Presentation[1]Inter Process Communication Presentation[1]
Inter Process Communication Presentation[1]
 
CPU Scheduling Algorithms
CPU Scheduling AlgorithmsCPU Scheduling Algorithms
CPU Scheduling Algorithms
 
Cache memory
Cache memoryCache memory
Cache memory
 
Process scheduling
Process schedulingProcess scheduling
Process scheduling
 
Page replacement algorithms
Page replacement algorithmsPage replacement algorithms
Page replacement algorithms
 
Multiprocessor system
Multiprocessor system Multiprocessor system
Multiprocessor system
 
Chapter 12 - Mass Storage Systems
Chapter 12 - Mass Storage SystemsChapter 12 - Mass Storage Systems
Chapter 12 - Mass Storage Systems
 

Andere mochten auch

Andere mochten auch (10)

Paging and Segmentation in Operating System
Paging and Segmentation in Operating SystemPaging and Segmentation in Operating System
Paging and Segmentation in Operating System
 
Virtual Memory and Paging
Virtual Memory and PagingVirtual Memory and Paging
Virtual Memory and Paging
 
Chapter 9 - Virtual Memory
Chapter 9 - Virtual MemoryChapter 9 - Virtual Memory
Chapter 9 - Virtual Memory
 
Paging
PagingPaging
Paging
 
04 Cache Memory
04  Cache  Memory04  Cache  Memory
04 Cache Memory
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
 
Operating System-Memory Management
Operating System-Memory ManagementOperating System-Memory Management
Operating System-Memory Management
 
8 memory management strategies
8 memory management strategies8 memory management strategies
8 memory management strategies
 
Memory management
Memory managementMemory management
Memory management
 

Ähnlich wie Virtual memory ppt

virtual-memory-130126022841-phpapp01.pdf
virtual-memory-130126022841-phpapp01.pdfvirtual-memory-130126022841-phpapp01.pdf
virtual-memory-130126022841-phpapp01.pdf
ry54321288
 
Symmetrix local replication
Symmetrix local replicationSymmetrix local replication
Symmetrix local replication
Sundeep Rao
 
Flash Economics and Lessons learned from operating low latency platforms at h...
Flash Economics and Lessons learned from operating low latency platforms at h...Flash Economics and Lessons learned from operating low latency platforms at h...
Flash Economics and Lessons learned from operating low latency platforms at h...
Aerospike, Inc.
 

Ähnlich wie Virtual memory ppt (20)

Virtual memory ppts
Virtual memory pptsVirtual memory ppts
Virtual memory ppts
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
 
virtualmemory-111228090333-phpapp02 (1).pdf
virtualmemory-111228090333-phpapp02 (1).pdfvirtualmemory-111228090333-phpapp02 (1).pdf
virtualmemory-111228090333-phpapp02 (1).pdf
 
VIRTUAL 2.pptx
VIRTUAL  2.pptxVIRTUAL  2.pptx
VIRTUAL 2.pptx
 
virtual-memory-130126022841-phpapp01.pdf
virtual-memory-130126022841-phpapp01.pdfvirtual-memory-130126022841-phpapp01.pdf
virtual-memory-130126022841-phpapp01.pdf
 
Virtual memory ppt
Virtual memory pptVirtual memory ppt
Virtual memory ppt
 
Abhaycavirtual memory and the pagehit.pptx
Abhaycavirtual memory and the pagehit.pptxAbhaycavirtual memory and the pagehit.pptx
Abhaycavirtual memory and the pagehit.pptx
 
Live memory forensics
Live memory forensicsLive memory forensics
Live memory forensics
 
Kernel Recipes 2017 - 20 years of Linux Virtual Memory - Andrea Arcangeli
Kernel Recipes 2017 - 20 years of Linux Virtual Memory - Andrea ArcangeliKernel Recipes 2017 - 20 years of Linux Virtual Memory - Andrea Arcangeli
Kernel Recipes 2017 - 20 years of Linux Virtual Memory - Andrea Arcangeli
 
Virtual Memory in Windows
Virtual Memory in Windows Virtual Memory in Windows
Virtual Memory in Windows
 
Symmetrix local replication
Symmetrix local replicationSymmetrix local replication
Symmetrix local replication
 
Operating System
Operating SystemOperating System
Operating System
 
Computer architecture ppt
Computer architecture pptComputer architecture ppt
Computer architecture ppt
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
 
Virtual memory
Virtual memoryVirtual memory
Virtual memory
 
Unit 2chapter 2 memory mgmt complete
Unit 2chapter 2  memory mgmt completeUnit 2chapter 2  memory mgmt complete
Unit 2chapter 2 memory mgmt complete
 
Mem mgt
Mem mgtMem mgt
Mem mgt
 
virtual memory
virtual memoryvirtual memory
virtual memory
 
The Forefront of the Development for NVDIMM on Linux Kernel
The Forefront of the Development for NVDIMM on Linux KernelThe Forefront of the Development for NVDIMM on Linux Kernel
The Forefront of the Development for NVDIMM on Linux Kernel
 
Flash Economics and Lessons learned from operating low latency platforms at h...
Flash Economics and Lessons learned from operating low latency platforms at h...Flash Economics and Lessons learned from operating low latency platforms at h...
Flash Economics and Lessons learned from operating low latency platforms at h...
 

Mehr von Punjab College Of Technical Education (10)

Blue brain
Blue brainBlue brain
Blue brain
 
Interrupts
InterruptsInterrupts
Interrupts
 
Intel
IntelIntel
Intel
 
CMS
CMSCMS
CMS
 
Saas (1)
Saas (1)Saas (1)
Saas (1)
 
Database fragmentation
Database fragmentationDatabase fragmentation
Database fragmentation
 
Privatisation
PrivatisationPrivatisation
Privatisation
 
Smart cards
Smart cards Smart cards
Smart cards
 
Microprocessor
MicroprocessorMicroprocessor
Microprocessor
 
Walt disney
Walt disneyWalt disney
Walt disney
 

Kürzlich hochgeladen

The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
heathfieldcps1
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
ZurliaSoop
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
KarakKing
 

Kürzlich hochgeladen (20)

Google Gemini An AI Revolution in Education.pptx
Google Gemini An AI Revolution in Education.pptxGoogle Gemini An AI Revolution in Education.pptx
Google Gemini An AI Revolution in Education.pptx
 
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdfMicro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
 
Spatium Project Simulation student brief
Spatium Project Simulation student briefSpatium Project Simulation student brief
Spatium Project Simulation student brief
 
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
 
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptxHMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
HMCS Vancouver Pre-Deployment Brief - May 2024 (Web Version).pptx
 
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
 
Making communications land - Are they received and understood as intended? we...
Making communications land - Are they received and understood as intended? we...Making communications land - Are they received and understood as intended? we...
Making communications land - Are they received and understood as intended? we...
 
REMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptxREMIFENTANIL: An Ultra short acting opioid.pptx
REMIFENTANIL: An Ultra short acting opioid.pptx
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)
 
How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17How to Give a Domain for a Field in Odoo 17
How to Give a Domain for a Field in Odoo 17
 
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptxHMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
HMCS Max Bernays Pre-Deployment Brief (May 2024).pptx
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
 
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
Kodo Millet  PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...Kodo Millet  PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
 
Key note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdfKey note speaker Neum_Admir Softic_ENG.pdf
Key note speaker Neum_Admir Softic_ENG.pdf
 
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdfUnit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdf
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
 
This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.This PowerPoint helps students to consider the concept of infinity.
This PowerPoint helps students to consider the concept of infinity.
 
Introduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The BasicsIntroduction to Nonprofit Accounting: The Basics
Introduction to Nonprofit Accounting: The Basics
 

Virtual memory ppt

  • 1. VIRTUAL MEMORY Present by: - Ravisha Sethi
  • 2. CONTENTS  virtual memory  Needs of virtual memory  Importance of virtual memory  Advantage of virtual memory  Disadvantage of virtual memory  Address space & memory space  Page replacement algorithms  FIFO  LRU  OPT
  • 3. VIRTUAL MEMORY  Virtual memory is a common part of operating system on desktop computers.  The term virtual memory refers to something which appears to be present but actually it is not.  The virtual memory technique allows users to use more memory for a program than the real memory of a computer. present Mapper CPU (1) (3) Page (4) frame + x Logical Not present Page page + x frames Virtual (5) address Page frames Secondary storage
  • 4. NEED OF VIRTUAL MEMORY  Virtual memory is a imaginary memory which we are assuming. If we have a material that exceed your memory at that time we need to use the concept of virtual memory.  virtual memory is temporary memory which is used along with the ram of the system.
  • 5. IMPORTANCE OF VIRTUAL MEMORY  When your computer runs out of physical memory it writes what it needs to remember to the hard disc in a swap file as virtual memory.  If a computer running Windows requires more memory/RAM then there is installed in the system to run a program, etc, it uses a small section of the hard drive for this purpose
  • 6. ADDRESS SPACE AND MEMORY SPACE  Virtual memory is the address used by the programmer and the set of such addresses is called address space.  An address in main memory is called a physical address.  The set of such locations in main memory is called the memory space.  Thus the memory space consist of the actual main memory locations directly addressable for processing.
  • 7. PAGE REPLACEMENT ALGORITHMS  In a computer operating system that uses paging for virtual memory management, page replacement algorithm decide which memory pages to page out. When a page of memory need to be allocated.  FIFO (first in first out)  LRU (Least Recently used)  OPT (Optimal)
  • 8. FIFO First in first out is very easy to implement. The fifo algorithm select the page for replacement that has been in memory the longest time. time 1 2 3 4 5 6 7 8 9 10 11 12 page P2 p3 p2 p1 p5 p2 p4 p5 p3 p2 p5 p2 p2* p2* p2* p2* P5 p5 p5* p5* P3 P3 P3 P3* p3 p3 P3 p3* P2 P2 P2 p2* P2* P5 P5 p4 P1 p1 P1* p4 p4 p4 P4* p2 hit hit hit
  • 9. LRU  The least recently used page replacement algorithm keeps track page uses over a short period of time.  The LRU algorithm can be implemented by associating a counter with every page that is n main memory. time 1 2 3 4 5 6 7 8 9 10 11 12 pag P2 p3 p2 p1 p5 p2 p4 p5 p3 p2 p5 p2 e p2* p2* P2 P2 p2* P2 P2 p2* P3 P3 P3* P3* p3 p3* p3* P5 P5 p5* P5 P5 P5* P5 P5 p4* P1 P1 P1* p4 P4 P2 P2 p2 hit hit hit hit hit
  • 10. OPT  The optimal policy selects that page for replacement for which the time to the next reference is longest.  This algorithm result is fewest number of page faults. time 1 2 3 4 5 6 7 8 9 10 11 12 page P2 p3 p2 p1 p5 p2 p4 p5 p3 p2 p5 p2 p2 p2 P2 P2 P2 P2 P4 P4 P4 P2 P2 P2 p3 p3 p3 P3 P3 P3 P3 P3 P3 P3 P3 p5 P1 P5 P5 p5 P5 P5 P5 P5 hit hit hit hit hit hit
  • 11. ADVANTAGES OF VIRTUAL MEMORY  Allows processes whose aggregate memory requirement is greater than the amount of physical memory, as infrequently used pages can reside on the disk.  Virtual memory allows speed gain when only a particular segment of the program is required for the execution of the program.  This concept is very helpful in implementing multiprogramming environment.
  • 12. DISADVANTAGES OF VIRTUAL MEMORY  Applications run slower if the system is using virtual memory.  It Takes more time to switch between applications.  Less hard drive space for your use.  It reduces system stability.