Virtual Mapping in Virtual Memory
•Download as PPTX, PDF•
0 likes•121 views
This is an PPT of Operating System. It include the following topic "Virtual Mapping in Virtual Memory ".
Report
Share
Report
Share
Recommended
Dead Lock
This document discusses different strategies for handling deadlocks in operating systems, including prevention, avoidance, detection, and recovery. Prevention methods aim to ensure that one of the four necessary conditions for deadlock does not occur. Avoidance allows all conditions but detects unsafe states and stops requests that could lead to deadlock. Detection identifies when a deadlock has occurred. Recovery methods regain resources by terminating processes or preempting resources to break cycles in resource allocation graphs.
Page replacement
The document discusses different page replacement algorithms used in operating systems. It explains that paging allows processes to have non-contiguous physical address spaces by retrieving data from secondary storage in blocks called pages. When a process tries to access a page not currently in memory, a page fault occurs and the operating system must handle it. If all memory pages are in use, one must be replaced to load the requested page. Common algorithms discussed are FIFO, LRU, and optimal page replacement. FIFO replaces the oldest page, but ignores locality. LRU tracks recent usage and replaces the least recently used page, avoiding Belady's Anomaly but being expensive to implement.
Memory Hierarchy
Memory Hierarchy
The memory unit is an essential component in any digital computer since it is needed for storing programs and data
Not all accumulated information is needed by the CPU at the same time
Therefore, it is more economical to use low-cost storage devices to serve as a backup for storing the information that is not currently used by CPU
auxiliary memory
main memory
cache memory
RAM– Random Access memory
Random Access Memory Types
Dynamic RAM (DRAM)
ROM(Read Only Memory)
ROM(Read Only Memory)
Memory organization in computer architecture
Memory organization in computer architecture
Volatile Memory
Non-Volatile Memory
Memory Hierarchy
Memory Access Methods
Random Access
Sequential Access
Direct Access
Main Memory
DRAM
SRAM
NVRAM
RAM: Random Access Memory
ROM: Read Only Memory
Auxiliary Memory
Cache Memory
Hit Ratio
Associative Memory
Cache memory and cache
The cache is a small amount of fast memory located close to the CPU that stores frequently accessed and nearby data from main memory in order to speed up data access times for the CPU. Without cache, every data request from the CPU would require accessing the slower main memory. Caches exploit the principle of locality of reference, where programs tend to access the same data repeatedly, to improve performance by fulfilling many requests from the faster cache instead of main memory.
Kernel. Operating System
The kernel is the core component of an operating system that acts as a bridge between applications and hardware. When a system loads, the kernel loads first and remains in memory to perform low-level tasks like disk management, task management, and memory management. Kernels interface between hardware components like the CPU, memory, and I/O devices to provide services and manage computer resources, allowing other programs to run and access these resources. There are different types of kernels that vary in their implementation of operating system services.
Memory organization
Memory organization
Memory Organization in Computer Architecture. A memory unit is the collection of storage units or devices together. The memory unit stores the binary information in the form of bits. ... Volatile Memory: This loses its data, when power is switched off.
Cache memory ppt
Cache memory is a small, fast memory located close to the processor that stores frequently accessed data from main memory. When the processor requests data, the cache is checked first. If the data is present, there is a cache hit and the data is accessed quickly from the cache. If not present, there is a cache hit and the data must be fetched from main memory, which takes longer. Cache memory relies on principles of temporal and spatial locality, where frequently and nearby accessed data is likely to be needed again soon. Mapping functions like direct, associative, and set-associative mapping determine how data is stored in the cache. Replacement policies like FIFO, LRU, etc. determine which cached data gets replaced when new
Recommended
Dead Lock
This document discusses different strategies for handling deadlocks in operating systems, including prevention, avoidance, detection, and recovery. Prevention methods aim to ensure that one of the four necessary conditions for deadlock does not occur. Avoidance allows all conditions but detects unsafe states and stops requests that could lead to deadlock. Detection identifies when a deadlock has occurred. Recovery methods regain resources by terminating processes or preempting resources to break cycles in resource allocation graphs.
Page replacement
The document discusses different page replacement algorithms used in operating systems. It explains that paging allows processes to have non-contiguous physical address spaces by retrieving data from secondary storage in blocks called pages. When a process tries to access a page not currently in memory, a page fault occurs and the operating system must handle it. If all memory pages are in use, one must be replaced to load the requested page. Common algorithms discussed are FIFO, LRU, and optimal page replacement. FIFO replaces the oldest page, but ignores locality. LRU tracks recent usage and replaces the least recently used page, avoiding Belady's Anomaly but being expensive to implement.
Memory Hierarchy
Memory Hierarchy
The memory unit is an essential component in any digital computer since it is needed for storing programs and data
Not all accumulated information is needed by the CPU at the same time
Therefore, it is more economical to use low-cost storage devices to serve as a backup for storing the information that is not currently used by CPU
auxiliary memory
main memory
cache memory
RAM– Random Access memory
Random Access Memory Types
Dynamic RAM (DRAM)
ROM(Read Only Memory)
ROM(Read Only Memory)
Memory organization in computer architecture
Memory organization in computer architecture
Volatile Memory
Non-Volatile Memory
Memory Hierarchy
Memory Access Methods
Random Access
Sequential Access
Direct Access
Main Memory
DRAM
SRAM
NVRAM
RAM: Random Access Memory
ROM: Read Only Memory
Auxiliary Memory
Cache Memory
Hit Ratio
Associative Memory
Cache memory and cache
The cache is a small amount of fast memory located close to the CPU that stores frequently accessed and nearby data from main memory in order to speed up data access times for the CPU. Without cache, every data request from the CPU would require accessing the slower main memory. Caches exploit the principle of locality of reference, where programs tend to access the same data repeatedly, to improve performance by fulfilling many requests from the faster cache instead of main memory.
Kernel. Operating System
The kernel is the core component of an operating system that acts as a bridge between applications and hardware. When a system loads, the kernel loads first and remains in memory to perform low-level tasks like disk management, task management, and memory management. Kernels interface between hardware components like the CPU, memory, and I/O devices to provide services and manage computer resources, allowing other programs to run and access these resources. There are different types of kernels that vary in their implementation of operating system services.
Memory organization
Memory organization
Memory Organization in Computer Architecture. A memory unit is the collection of storage units or devices together. The memory unit stores the binary information in the form of bits. ... Volatile Memory: This loses its data, when power is switched off.
Cache memory ppt
Cache memory is a small, fast memory located close to the processor that stores frequently accessed data from main memory. When the processor requests data, the cache is checked first. If the data is present, there is a cache hit and the data is accessed quickly from the cache. If not present, there is a cache hit and the data must be fetched from main memory, which takes longer. Cache memory relies on principles of temporal and spatial locality, where frequently and nearby accessed data is likely to be needed again soon. Mapping functions like direct, associative, and set-associative mapping determine how data is stored in the cache. Replacement policies like FIFO, LRU, etc. determine which cached data gets replaced when new
multiprocessors and multicomputers
Categories of Parallel Computers,Shared-Memory Multiprocessors, uma, numa , coma,Vector Processor Models,SIMD Supercomputers
Memory Organization
The document discusses computer memory organization and the memory hierarchy. It describes different types of memory like RAM, ROM, cache memory and secondary storage. It explains the memory hierarchy as fast but expensive memory like registers and cache being used for frequently accessed data, while slower but cheaper memory like hard disks are used for long term and bulk storage. The principle of locality is discussed where programs tend to access data and instructions that are near each other in memory. Cache memory aims to improve performance by storing recently accessed data from main memory.
Memory Organization
This slide contain the introduction to memory , hierarchy, types, virtual memory,associative memory and cache memory.
Computer memory
The document discusses the history and types of computer memory. It describes how early memory in the 1940s had a capacity of only a few bytes. The ENIAC was the first electronic, general-purpose computer capable of being reprogrammed. Delay line memory was an early form that stored data as acoustic waves in mercury delay lines. Magnetic core memory, developed in 1947, allowed memory to be retained after power loss and became the dominant memory technology of the 1960s. Modern computers use semiconductor memory such as RAM, ROM, cache memory, and flash memory. RAM allows random access and comes in dynamic and static varieties, while ROM is read-only and flash memory is non-volatile.
Chapter 11 - File System Implementation
File-System Structure
File-System Implementation
Directory Implementation
Allocation Methods
Free-Space Management
Efficiency and Performance
Recovery
Log-Structured File Systems
NFS
Example: WAFL File System
OpenMP Tutorial for Beginners
OpenMP is an API used for multi-threaded parallel programming on shared memory machines. It uses compiler directives, runtime libraries and environment variables. OpenMP supports C/C++ and Fortran. The programming model uses a fork-join execution model with explicit parallelism defined by the programmer. Compiler directives like #pragma omp parallel are used to define parallel regions. Work is shared between threads using constructs like for, sections and tasks. Synchronization is implemented using barriers, critical sections and locks.
memory Interleaving and low order interleaving and high interleaving
Memory interleaving splits memory into independent banks that can process read/write requests in parallel to increase throughput. It interleaves the address space so consecutive addresses are assigned to different banks. Low order interleaving uses the low order bits of an address to identify the memory module and high order bits for the word address within each module, allowing block access in a pipelined fashion. This improves the effective memory bandwidth.
Ch4 memory management
This document discusses different approaches to memory management in operating systems. It begins by describing monoprogramming without swapping or paging, where one program uses all available memory at a time. It then describes multiprogramming using fixed memory partitions, either with separate queues for each partition or a single queue. The challenges of relocation and protection when programs are loaded at different addresses are also covered. Finally, it introduces the concepts of swapping and virtual memory for handling situations where not all active processes fit in main memory.
Computer architecture input output organization
Computer Architecture Input Output Organization seminar
Mustansiriya University
Department of Education
Computer Science
2. microkernel new
This document discusses operating system architecture and kernel types. It defines the kernel as the fundamental part of the OS that provides secure access to hardware and decides resource allocation. Kernels can take different forms: monolithic kernels have all services in kernel space for good performance but are difficult to maintain; microkernels minimize the kernel to essential functions and put most services in user space for better modularity but more overhead; hybrid kernels combine aspects of monolithic and microkernels; nano and exokernels are more minimal.
Computer Architecture
Introduction, Central Processing Unit (CPU) Memory, Communication between Various Units of a Computer System, The Instruction Format, Instruction Set, Processor Speed, Multiprocessor Systems.
7 Deadlocks
The document discusses different methods for handling deadlocks in a system. It describes deadlock characterization including the necessary conditions for deadlock, using a resource-allocation graph to model deadlocks, and examples of such graphs. It also explains several methods for handling deadlocks including deadlock prevention, avoidance, and detection and recovery. Deadlock prevention methods aim to enforce constraints to ensure the necessary conditions for deadlock cannot occur. Deadlock avoidance uses additional information to dynamically monitor the system state and ensure it remains in a safe state where deadlocks cannot happen.
Memory organisation
Memory is an essential component of computers that is used to store programs and data. Computers typically have three levels of memory: main memory, secondary memory, and cache memory. Main memory is fast memory that stores programs and data being executed. Secondary memory is permanent storage for programs and data used less frequently. Cache memory sits between the CPU and main memory for faster access. Memory is also classified by location, access method, volatility, and type.
Memory Hierarchy
The document discusses the memory hierarchy in computers. It describes the different levels of memory from fastest to slowest as register memory, cache memory, main memory (RAM and ROM), and auxiliary memory (magnetic tapes, hard disks, etc.). The main memory directly communicates with the CPU while the auxiliary memory provides backup storage and needs to transfer data to main memory to be accessed by the CPU. A cache memory is also used to increase processing speed.
Understanding RAID Levels (RAID 0, RAID 1, RAID 2, RAID 3, RAID 4, RAID 5)
http://bit.ly/1I6PJtA Learn more about the different RAID Levels (RAID 0, RAID 1, RAID 2, RAID 3, RAID 4, RAID 5).
CS4109 Computer System Architecture
This document provides an overview of the CS4109 Computer System Architecture course taught by Prof. K.Sridhar Patnaik at BIT Mesra, Ranchi. The course objectives are to learn how computers work, analyze performance, and understand computer design and modern processor issues. The knowledge is useful for tasks like designing computers, improving software performance, and providing embedded solutions. Key topics covered include performance, instruction set architecture, arithmetic logic units, processor construction, pipelining, memory systems, and input/output. The document also discusses computer organization versus architecture, Turing machines as a model of computation, and the Church-Turing thesis.
Multiprocessor
This document discusses multiprocessor computer systems. It begins by defining a multiprocessor system as having two or more CPUs connected to a shared memory and I/O devices. Multiprocessors are classified as MIMD systems. They provide benefits like improved performance over single CPU systems for tasks like multi-user/multi-tasking applications. Multiprocessors are further classified as tightly-coupled or loosely-coupled based on shared vs distributed memory. Common interconnection structures discussed include bus, multport memory, crossbar switch, and hypercube networks.
Paging and Segmentation in Operating System
The document discusses different types of memory used in computers including physical memory, logical memory, and virtual memory. It describes how virtual memory uses paging and segmentation techniques to allow programs to access more memory than is physically available. Paging divides memory into fixed-size pages that can be swapped between RAM and secondary storage, while segmentation divides memory into variable-length, protected segments. The combination of paging and segmentation provides memory protection and efficient use of available RAM.
Distributed operating system
A distributed system is a collection of independent computers that appears as a single coherent system to users. It provides advantages like cost-effectiveness, reliability, scalability, and flexibility but introduces challenges in achieving transparency, dependability, performance, and flexibility due to its distributed nature. A true distributed system that solves all these challenges perfectly is difficult to achieve due to limitations like network complexity and security issues.
Memory system
The document discusses various types of computer memory technologies, including RAM types like DRAM, SRAM, DDR, DDR2, and DDR3. It explains the memory hierarchy from registers to cache to main memory to disks. Key points covered include how DRAM works using capacitors that must be periodically refreshed, advantages of SDRAM over regular DRAM like pipelining commands. Generations of DDR memory are compared in terms of clock speeds, data rates, and other features.
virtual memory
Virtual memory is a memory management technique that allows programs to access memory addresses beyond their actual physical RAM size. It maps virtual addresses to physical addresses stored in RAM or on a hard disk using page tables and a translation process. When a program requests a page not in RAM, a page fault occurs and the OS moves a page from disk to RAM, suspending the program until the page is loaded. Page replacement algorithms like LRU then select pages to remove from RAM and write to disk when RAM is full to make space for new pages. This allows for larger memory sizes, more efficient memory usage, and multitasking.
Virtual Memory vs Cache Memory
This document discusses virtual memory and cache memory. It defines virtual memory as a technique that allows programs to behave as if they have contiguous memory even if the actual physical memory is fragmented. It also describes how virtual memory provides each process with its own address space and hides fragmentation. The document also defines cache memory as a small, fast memory located close to the CPU that stores frequently accessed instructions and data to improve performance. It describes levels 1 and 2 caches and how they work with memory and disk caches.
More Related Content
What's hot
multiprocessors and multicomputers
Categories of Parallel Computers,Shared-Memory Multiprocessors, uma, numa , coma,Vector Processor Models,SIMD Supercomputers
Memory Organization
The document discusses computer memory organization and the memory hierarchy. It describes different types of memory like RAM, ROM, cache memory and secondary storage. It explains the memory hierarchy as fast but expensive memory like registers and cache being used for frequently accessed data, while slower but cheaper memory like hard disks are used for long term and bulk storage. The principle of locality is discussed where programs tend to access data and instructions that are near each other in memory. Cache memory aims to improve performance by storing recently accessed data from main memory.
Memory Organization
This slide contain the introduction to memory , hierarchy, types, virtual memory,associative memory and cache memory.
Computer memory
The document discusses the history and types of computer memory. It describes how early memory in the 1940s had a capacity of only a few bytes. The ENIAC was the first electronic, general-purpose computer capable of being reprogrammed. Delay line memory was an early form that stored data as acoustic waves in mercury delay lines. Magnetic core memory, developed in 1947, allowed memory to be retained after power loss and became the dominant memory technology of the 1960s. Modern computers use semiconductor memory such as RAM, ROM, cache memory, and flash memory. RAM allows random access and comes in dynamic and static varieties, while ROM is read-only and flash memory is non-volatile.
Chapter 11 - File System Implementation
File-System Structure
File-System Implementation
Directory Implementation
Allocation Methods
Free-Space Management
Efficiency and Performance
Recovery
Log-Structured File Systems
NFS
Example: WAFL File System
OpenMP Tutorial for Beginners
OpenMP is an API used for multi-threaded parallel programming on shared memory machines. It uses compiler directives, runtime libraries and environment variables. OpenMP supports C/C++ and Fortran. The programming model uses a fork-join execution model with explicit parallelism defined by the programmer. Compiler directives like #pragma omp parallel are used to define parallel regions. Work is shared between threads using constructs like for, sections and tasks. Synchronization is implemented using barriers, critical sections and locks.
memory Interleaving and low order interleaving and high interleaving
Memory interleaving splits memory into independent banks that can process read/write requests in parallel to increase throughput. It interleaves the address space so consecutive addresses are assigned to different banks. Low order interleaving uses the low order bits of an address to identify the memory module and high order bits for the word address within each module, allowing block access in a pipelined fashion. This improves the effective memory bandwidth.
Ch4 memory management
This document discusses different approaches to memory management in operating systems. It begins by describing monoprogramming without swapping or paging, where one program uses all available memory at a time. It then describes multiprogramming using fixed memory partitions, either with separate queues for each partition or a single queue. The challenges of relocation and protection when programs are loaded at different addresses are also covered. Finally, it introduces the concepts of swapping and virtual memory for handling situations where not all active processes fit in main memory.
Computer architecture input output organization
Computer Architecture Input Output Organization seminar
Mustansiriya University
Department of Education
Computer Science
2. microkernel new
This document discusses operating system architecture and kernel types. It defines the kernel as the fundamental part of the OS that provides secure access to hardware and decides resource allocation. Kernels can take different forms: monolithic kernels have all services in kernel space for good performance but are difficult to maintain; microkernels minimize the kernel to essential functions and put most services in user space for better modularity but more overhead; hybrid kernels combine aspects of monolithic and microkernels; nano and exokernels are more minimal.
Computer Architecture
Introduction, Central Processing Unit (CPU) Memory, Communication between Various Units of a Computer System, The Instruction Format, Instruction Set, Processor Speed, Multiprocessor Systems.
7 Deadlocks
The document discusses different methods for handling deadlocks in a system. It describes deadlock characterization including the necessary conditions for deadlock, using a resource-allocation graph to model deadlocks, and examples of such graphs. It also explains several methods for handling deadlocks including deadlock prevention, avoidance, and detection and recovery. Deadlock prevention methods aim to enforce constraints to ensure the necessary conditions for deadlock cannot occur. Deadlock avoidance uses additional information to dynamically monitor the system state and ensure it remains in a safe state where deadlocks cannot happen.
Memory organisation
Memory is an essential component of computers that is used to store programs and data. Computers typically have three levels of memory: main memory, secondary memory, and cache memory. Main memory is fast memory that stores programs and data being executed. Secondary memory is permanent storage for programs and data used less frequently. Cache memory sits between the CPU and main memory for faster access. Memory is also classified by location, access method, volatility, and type.
Memory Hierarchy
The document discusses the memory hierarchy in computers. It describes the different levels of memory from fastest to slowest as register memory, cache memory, main memory (RAM and ROM), and auxiliary memory (magnetic tapes, hard disks, etc.). The main memory directly communicates with the CPU while the auxiliary memory provides backup storage and needs to transfer data to main memory to be accessed by the CPU. A cache memory is also used to increase processing speed.
Understanding RAID Levels (RAID 0, RAID 1, RAID 2, RAID 3, RAID 4, RAID 5)
http://bit.ly/1I6PJtA Learn more about the different RAID Levels (RAID 0, RAID 1, RAID 2, RAID 3, RAID 4, RAID 5).
CS4109 Computer System Architecture
This document provides an overview of the CS4109 Computer System Architecture course taught by Prof. K.Sridhar Patnaik at BIT Mesra, Ranchi. The course objectives are to learn how computers work, analyze performance, and understand computer design and modern processor issues. The knowledge is useful for tasks like designing computers, improving software performance, and providing embedded solutions. Key topics covered include performance, instruction set architecture, arithmetic logic units, processor construction, pipelining, memory systems, and input/output. The document also discusses computer organization versus architecture, Turing machines as a model of computation, and the Church-Turing thesis.
Multiprocessor
This document discusses multiprocessor computer systems. It begins by defining a multiprocessor system as having two or more CPUs connected to a shared memory and I/O devices. Multiprocessors are classified as MIMD systems. They provide benefits like improved performance over single CPU systems for tasks like multi-user/multi-tasking applications. Multiprocessors are further classified as tightly-coupled or loosely-coupled based on shared vs distributed memory. Common interconnection structures discussed include bus, multport memory, crossbar switch, and hypercube networks.
Paging and Segmentation in Operating System
The document discusses different types of memory used in computers including physical memory, logical memory, and virtual memory. It describes how virtual memory uses paging and segmentation techniques to allow programs to access more memory than is physically available. Paging divides memory into fixed-size pages that can be swapped between RAM and secondary storage, while segmentation divides memory into variable-length, protected segments. The combination of paging and segmentation provides memory protection and efficient use of available RAM.
Distributed operating system
A distributed system is a collection of independent computers that appears as a single coherent system to users. It provides advantages like cost-effectiveness, reliability, scalability, and flexibility but introduces challenges in achieving transparency, dependability, performance, and flexibility due to its distributed nature. A true distributed system that solves all these challenges perfectly is difficult to achieve due to limitations like network complexity and security issues.
Memory system
The document discusses various types of computer memory technologies, including RAM types like DRAM, SRAM, DDR, DDR2, and DDR3. It explains the memory hierarchy from registers to cache to main memory to disks. Key points covered include how DRAM works using capacitors that must be periodically refreshed, advantages of SDRAM over regular DRAM like pipelining commands. Generations of DDR memory are compared in terms of clock speeds, data rates, and other features.
What's hot (20)
memory Interleaving and low order interleaving and high interleaving
memory Interleaving and low order interleaving and high interleaving
Understanding RAID Levels (RAID 0, RAID 1, RAID 2, RAID 3, RAID 4, RAID 5)
Understanding RAID Levels (RAID 0, RAID 1, RAID 2, RAID 3, RAID 4, RAID 5)
Similar to Virtual Mapping in Virtual Memory
virtual memory
Virtual memory is a memory management technique that allows programs to access memory addresses beyond their actual physical RAM size. It maps virtual addresses to physical addresses stored in RAM or on a hard disk using page tables and a translation process. When a program requests a page not in RAM, a page fault occurs and the OS moves a page from disk to RAM, suspending the program until the page is loaded. Page replacement algorithms like LRU then select pages to remove from RAM and write to disk when RAM is full to make space for new pages. This allows for larger memory sizes, more efficient memory usage, and multitasking.
Virtual Memory vs Cache Memory
This document discusses virtual memory and cache memory. It defines virtual memory as a technique that allows programs to behave as if they have contiguous memory even if the actual physical memory is fragmented. It also describes how virtual memory provides each process with its own address space and hides fragmentation. The document also defines cache memory as a small, fast memory located close to the CPU that stores frequently accessed instructions and data to improve performance. It describes levels 1 and 2 caches and how they work with memory and disk caches.
Unit 5-lecture-2
The document discusses cache memory, virtual memory, and memory management in hardware. It describes how cache memory stores frequently used data from main memory for faster CPU access. Virtual memory allows programs to access more memory than physically available by mapping virtual addresses to physical addresses. The performance of cache memory is measured by hit and miss rates, with hits accessing the cache faster and misses requiring additional time to retrieve data from main memory.
virtual memory.ppt
Virtual memory allows programs to access memory addresses that map to locations in secondary storage rather than physical RAM, enlarging the effective memory available to programs. When programs access virtual addresses, the memory management unit translates them to physical addresses. If the requested page is not in RAM, a page fault occurs and the operating system moves pages between RAM and secondary storage transparently. Segmentation divides memory into variable sized segments while paging uses fixed sized pages, but both aim to make memory allocation more flexible. Common paging replacement algorithms are FIFO, LRU, and LFU. Virtual memory provides benefits like running programs partially in memory and increasing parallelism.
Chapter 09 - Virtual Memory.ppt
Virtual memory allows programs to access memory addresses that do not physically exist, expanding the available address space. When a program accesses a virtual address, the memory management unit translates it to a real physical address. If the requested page is not in memory, it is swapped in from secondary storage. This allows programs to behave as if they have more memory than is physically installed, improving efficiency and allowing more programs to run simultaneously.
Virtual memory
The document discusses virtual memory. It defines virtual memory as a section of the hard disk that is used as additional memory when physical RAM is full. Virtual memory allows computers to address more memory than is physically installed by swapping processes between RAM and disk storage. Some benefits of virtual memory include allowing for more applications to run simultaneously and reducing constraints of limited RAM.
NOV11 virtual memory.ppt
Virtual memory allows programs to access memory addresses that do not physically exist, expanding the available address space. It works by dividing memory into pages that are stored on disk until needed, then copied into RAM. When a program accesses a non-present page, a page fault occurs and the operating system handles copying the correct page into memory transparently to the program. This allows more programs to run than would otherwise fit in physical memory.
lecture-2-3_Memory.pdf,describing memory
The document discusses the memory hierarchy and cache memories. It begins by describing the main components of the memory system: main memory and secondary memory. The key issues are that microprocessors are much faster than memory, and larger memories are slower. To address this, a memory hierarchy is used that combines fast, small, expensive memory levels with slower, larger, cheaper levels. Caches are discussed as a small, fast memory located between the CPU and main memory. Caches improve performance by exploiting locality of reference in programs. Different cache organizations like direct mapping and set associative mapping are described to determine where blocks are placed in the cache on a miss.
virtualmemory-111228090333-phpapp02 (1).pdf
Virtual memory allows a computer to use more memory (called the address space) than is physically installed in the system (the memory space) by storing rarely used data on disk. When data is needed, it is moved back into memory. This allows for multiprogramming and for individual programs to be larger than physical memory. Common page replacement algorithms that determine what data to remove from memory and store on disk include first-in, first-out (FIFO), least recently used (LRU), and optimal (OPT) which removes the page not used for the longest time.
Memory organization (Computer architecture)
Memory is organized in a hierarchy with different levels providing trade-offs between speed and cost.
- Cache memory sits between the CPU and main memory for fastest access.
- Main memory (RAM) is where active programs and data reside and is faster than auxiliary memory but more expensive.
- Auxiliary memory (disks, tapes) provides backup storage and is slower than main memory but larger and cheaper.
Virtual memory manages this hierarchy through address translation techniques like paging that map virtual addresses to physical locations, allowing programs to access more memory than physically available. When data is needed from auxiliary memory a page fault occurs and page replacement algorithms determine what data to remove from main memory.
Memory Organization.pdf
This document discusses memory hierarchy and organization, including main memory, cache memory, virtual memory, and mapping techniques. It provides details on different types of memory like RAM, ROM, cache mapping using direct mapping, set associative mapping, and associative mapping. It also discusses concepts of virtual memory like address space, memory space, page frames, and page replacement algorithms.
Memory Hierarchy
This document provides an overview of various components of computer memory hierarchy, including main memory, auxiliary memory, associative memory, cache memory, virtual memory, and memory management hardware. Main memory uses RAM and ROM chips as primary storage during runtime. Auxiliary memory includes magnetic disks and tapes for long-term secondary storage. Associative memory allows for fast parallel searches. Cache memory acts as a buffer between the CPU and main memory for frequently accessed data. Virtual memory allows programs to access secondary storage as if it were main memory. Memory management hardware in operating systems allocates and manages memory usage between processes.
Paging +Algorithem+Segmentation+memory management
The document discusses memory management techniques used in computer systems, including memory partitioning, paging, segmentation, and virtual memory. It provides details on:
1) How memory is divided between the operating system and currently running program.
2) The use of fixed and variable size partitions and their tradeoffs.
3) How paging divides programs and memory into pages to more efficiently allocate memory.
4) How segmentation further subdivides memory to simplify programming and enable access controls.
5) How virtual memory uses paging, disk storage, and demand paging to make programs appear larger than physical memory.
NOV11 virtual memory.ppt
Virtual memory allows programs to access memory addresses that map to both physical RAM and secondary storage. It uses paging to divide memory into fixed pages that are swapped between RAM and storage as needed. This enables programs to have a larger address space than the available physical memory, improving performance by reducing I/O and allowing more programs to run simultaneously.
Multilevel arch & str org.& mips, 8086, memory
The document discusses the need for memory hierarchy in computers. It explains that main memory communicates directly with the CPU, while auxiliary memory devices like magnetic tapes and disks provide backup storage. The overall goal of the memory hierarchy is to obtain the highest average access speed while minimizing total memory system costs. It achieves this through a hierarchy from slow but high-capacity auxiliary devices to faster main memory to an even smaller and faster cache memory.
Virtual memory presentation
Virtual memory allows a program to use more memory than the physical RAM installed on a computer. It works by storing portions of programs and data that are not actively being used on the hard disk, freeing up RAM for active portions. This gives the illusion to the user and programs that they have access to more memory than is physically present. Virtual memory provides advantages like allowing more programs to run at once and not requiring additional RAM purchases, but can reduce performance due to the need to access the hard disk.
Microprocessors and memory concepts
Classification of Microprocessors
Apart from the width of data (word length) that the microprocessors can process at a time, the classification
is also based on the architecture i.e. Instruction Set of the microprocessor. While studying about CPUs,
we come across two abbreviations CISC and RISC.
Memory managment
Computer memory can be divided into primary/main memory and secondary memory. Primary memory is directly accessible by the CPU and can be volatile, losing data on power loss. It includes RAM (random access memory) such as SRAM and DRAM. Secondary memory includes non-volatile storage like hard disks, CDs, DVDs that are accessed via I/O. The document discusses different types of primary memory like cache, RAM, ROM and their characteristics. It also covers memory management techniques like paging, segmentation and virtual memory that allow accessing more memory than physically installed.
Paging and Segmentation
The document discusses memory segmentation and paging techniques used in operating systems. Segmentation divides memory into variable-length segments, while paging divides memory into fixed-size pages. Paging maps logical pages to physical frame addresses using a page table for efficient memory access. It allows programs to access more memory than is physically available by swapping pages between memory and disk. The combination of segmentation and paging provides memory protection and reduces internal and external fragmentation.
Similar to Virtual Mapping in Virtual Memory (20)
More from Meghaj Mallick
24 partial-orderings
This document defines and provides examples of partial order relations. It discusses the key properties of a partial order being reflexive, antisymmetric, and transitive. Examples are given to show that the relation of greater than or equal to (≥) forms a partial order on integers, while division (|) forms a partial order on positive integers. The document also discusses comparability, total orders, well-ordered sets, and Hasse diagrams which are used to visually represent partial orders.
PORTFOLIO BY USING HTML & CSS
The primary focus of the PPT is to develop the initial skill of using HTML & CSS programming language to develop a static web page like Portfolio.
This PowerPoint Presentation is of Front End Design.
This PPT will give an entire view on developing the static web page.
Introduction to Software Testing
The primary focus is on Software Testing process. This PPT will covers the overall process of the software testing.
Introduction to System Programming
The entire PPT focuses about the subject "System Programming".
The PPT consist of the basics of the topic that will cover the entire topic.
MACRO ASSEBLER
This PPT covers the entire topic of Macro Assembler. This Includes the topic such as design of a macro assembler, 3 passes of macro assembler etc.
This is the PPT of System Programming.
Icons, Image & Multimedia
This is an PPT about the Icons that are used in Graphical User Interface, the Images that are used for developing a web page & the use of multimedia for various purpose.
This is an PowerPoint Presentation of Front End Design.
Project Tracking & SPC
This PPT describes about the "Project Tracking" activity & statistical process control at Infosys.
It covers the entire topic such as project tracking, activities tracking, defect tracking, issue tracking, etc.
It covers all main activity of SPC such as SPC analysis, control chart for SPC etc.
This PowerPoint presentation is of "Software Project Management".
Peephole Optimization
This is the PowerPoint presentation on the topic "Peephole Optimization". This presentation covers the entire topic of peephole optimization.
This PowerPoint presentation is of Compiler Design.
Routing in MANET
This is the PPT of "Routing in Manet". It covers the entire topic of routing protocol.
This PowerPoint presentation is of Data Communication & Computer Network.
Macro assembler
The document discusses the design of a two-pass macro preprocessor. In pass one, macro definitions are identified and stored in a macro definition table along with their parameters. A macro name table is also created. In pass two, macro calls are identified and replaced by retrieving the corresponding macro definition and substituting actual parameters for formal parameters using an argument list array. Databases like the macro definition table, macro name table, and argument list array are used to store and retrieve macro information to enable expansion of macro calls. The algorithm scans the input sequentially in each pass to process macro definitions and calls.
Architecture and security in Vanet PPT
This document discusses Vehicular Ad-Hoc Networks (VANETs) which allow vehicles to communicate with each other to share safety and traffic information. It outlines the architecture of VANETs including vehicle-to-vehicle and vehicle-to-infrastructure communication. The document also discusses security issues in VANETs such as bogus information attacks, identity disclosure, and denial-of-service attacks. It proposes the use of authentication, message integrity, privacy, traceability and availability to address these security requirements. The document assumes that roadways are divided into regions managed by trusted roadside infrastructure units.
Design Model & User Interface Design in Software Engineering
This is an PPT of Software Engineering. This contains the following topic such as "Design Model & User Interface Design in Software Engineering ".
Text Mining of Twitter in Data Mining
This is an PPPt of Data Mining.It contains the following topic such as " Text Mining of Twitter in Data Mining".
DFS & BFS in Computer Algorithm
This document discusses breadth-first search (BFS) and depth-first search (DFS) algorithms for traversing graphs. It provides examples of how BFS uses a queue to search all neighbors at the current level before moving to the next level, while DFS uses a stack and explores each branch as far as possible before backtracking. The document compares key differences between BFS and DFS such as their time and space complexities, usefulness for finding shortest paths, and whether queues or stacks are used. Application areas for each algorithm are also mentioned.
Software Development Method
This is PPT of Computer-Science Paper. This presentation consist of various software development method.
Secant method in Numerical & Statistical Method
This is an PPT of a Mathematical Paper i.e Numerical & Statistical Method. It contsin the following topic such as "Secant method in Numerical & Statistical Method ".
Motivation in Organization
This is an PPT of Management. This contains the following topic such as "Motivation in Organization".
Communication Skill
This document discusses communication and barriers to effective communication. It defines communication as the exchange of information, ideas, thoughts and feelings between individuals through speech, writing and behavior. It then outlines some common barriers to communication, including badly expressed messages, loss in transmission, semantic problems, over or under communication, prejudices on the sender's part, and poor attention, inattentive listening, evaluation, interests/attitudes and refutation on the receiver's part. The document suggests identifying and addressing such barriers to improve communication.
Partial-Orderings in Discrete Mathematics
This is an PPT of Discrete Mathematics. It contains the following topic " Partial-Orderings in Discrete Mathematics ".
Hashing In Data Structure
This document provides an introduction to hashing and hash tables. It defines hashing as a data structure that uses a hash function to map values to keys for fast retrieval. It gives an example of mapping list values to array indices using modulo. The document discusses hash tables and their operations of search, insert and delete in O(1) time. It describes collisions that occur during hash function mapping and resolution techniques like separate chaining and linear probing.
More from Meghaj Mallick (20)
Design Model & User Interface Design in Software Engineering
Design Model & User Interface Design in Software Engineering
Recently uploaded
IEEE CIS Webinar Sustainable futures.pdf
The importance of sustainable and efficient computational practices in artificial intelligence (AI) and deep learning has become increasingly critical. This webinar focuses on the intersection of sustainability and AI, highlighting the significance of energy-efficient deep learning, innovative randomization techniques in neural networks, the potential of reservoir computing, and the cutting-edge realm of neuromorphic computing. This webinar aims to connect theoretical knowledge with practical applications and provide insights into how these innovative approaches can lead to more robust, efficient, and environmentally conscious AI systems.
Webinar Speaker: Prof. Claudio Gallicchio, Assistant Professor, University of Pisa
Claudio Gallicchio is an Assistant Professor at the Department of Computer Science of the University of Pisa, Italy. His research involves merging concepts from Deep Learning, Dynamical Systems, and Randomized Neural Systems, and he has co-authored over 100 scientific publications on the subject. He is the founder of the IEEE CIS Task Force on Reservoir Computing, and the co-founder and chair of the IEEE Task Force on Randomization-based Neural Networks and Learning Systems. He is an associate editor of IEEE Transactions on Neural Networks and Learning Systems (TNNLS).
Artificial Intelligence, Data and Competition – OECD – June 2024 OECD discussion
Artificial Intelligence, Data and Competition – OECD – June 2024 OECD discussionOECD Directorate for Financial and Enterprise Affairs
This presentation by OECD, OECD Secretariat, was made during the discussion “Artificial Intelligence, Data and Competition” held at the 143rd meeting of the OECD Competition Committee on 12 June 2024. More papers and presentations on the topic can be found at oe.cd/aicomp.
This presentation was uploaded with the author’s consent.
Collapsing Narratives: Exploring Non-Linearity • a micro report by Rosie Wells
Insight: In a landscape where traditional narrative structures are giving way to fragmented and non-linear forms of storytelling, there lies immense potential for creativity and exploration.
'Collapsing Narratives: Exploring Non-Linearity' is a micro report from Rosie Wells.
Rosie Wells is an Arts & Cultural Strategist uniquely positioned at the intersection of grassroots and mainstream storytelling.
Their work is focused on developing meaningful and lasting connections that can drive social change.
Please download this presentation to enjoy the hyperlinks!
The remarkable life of Sir Mokshagundam Visvesvaraya.pptx
The remarkable life of Sir Mokshagundam Visvesvaraya.pptx
Artificial Intelligence, Data and Competition – LIM – June 2024 OECD discussion
Artificial Intelligence, Data and Competition – LIM – June 2024 OECD discussionOECD Directorate for Financial and Enterprise Affairs
This presentation by Yong Lim, Professor of Economic Law at Seoul National University School of Law, was made during the discussion “Artificial Intelligence, Data and Competition” held at the 143rd meeting of the OECD Competition Committee on 12 June 2024. More papers and presentations on the topic can be found at oe.cd/aicomp.
This presentation was uploaded with the author’s consent.
Competition and Regulation in Professions and Occupations – ROBSON – June 202...
Competition and Regulation in Professions and Occupations – ROBSON – June 202...OECD Directorate for Financial and Enterprise Affairs
This presentation by Professor Alex Robson, Deputy Chair of Australia’s Productivity Commission, was made during the discussion “Competition and Regulation in Professions and Occupations” held at the 77th meeting of the OECD Working Party No. 2 on Competition and Regulation on 10 June 2024. More papers and presentations on the topic can be found at oe.cd/crps.
This presentation was uploaded with the author’s consent.Disaster Management project for holidays homework and other uses
It talks about disaster management in a helful way.
The Intersection between Competition and Data Privacy – COLANGELO – June 2024...
The Intersection between Competition and Data Privacy – COLANGELO – June 2024...OECD Directorate for Financial and Enterprise Affairs
This presentation by Professor Giuseppe Colangelo, Jean Monnet Professor of European Innovation Policy, was made during the discussion “The Intersection between Competition and Data Privacy” held at the 143rd meeting of the OECD Competition Committee on 13 June 2024. More papers and presentations on the topic can be found at oe.cd/ibcdp.
This presentation was uploaded with the author’s consent.
XP 2024 presentation: A New Look to Leadership
Presentation slides from XP2024 conference, Bolzano IT. The slides describe a new view to leadership and combines it with anthro-complexity (aka cynefin).
Artificial Intelligence, Data and Competition – SCHREPEL – June 2024 OECD dis...
Artificial Intelligence, Data and Competition – SCHREPEL – June 2024 OECD dis...OECD Directorate for Financial and Enterprise Affairs
This presentation by Thibault Schrepel, Associate Professor of Law at Vrije Universiteit Amsterdam University, was made during the discussion “Artificial Intelligence, Data and Competition” held at the 143rd meeting of the OECD Competition Committee on 12 June 2024. More papers and presentations on the topic can be found at oe.cd/aicomp.
This presentation was uploaded with the author’s consent.
Competition and Regulation in Professions and Occupations – OECD – June 2024 ...
Competition and Regulation in Professions and Occupations – OECD – June 2024 ...OECD Directorate for Financial and Enterprise Affairs
This presentation by OECD, OECD Secretariat, was made during the discussion “Competition and Regulation in Professions and Occupations” held at the 77th meeting of the OECD Working Party No. 2 on Competition and Regulation on 10 June 2024. More papers and presentations on the topic can be found at oe.cd/crps.
This presentation was uploaded with the author’s consent.
原版制作贝德福特大学毕业证（bedfordhire毕业证）硕士文凭原版一模一样
原版一模一样【微信：741003700 】【贝德福特大学毕业证（bedfordhire毕业证）硕士文凭】【微信：741003700 】学位证，留信认证（真实可查，永久存档）offer、雅思、外壳等材料/诚信可靠,可直接看成品样本，帮您解决无法毕业带来的各种难题！外壳，原版制作，诚信可靠，可直接看成品样本。行业标杆！精益求精，诚心合作，真诚制作！多年品质 ,按需精细制作，24小时接单,全套进口原装设备。十五年致力于帮助留学生解决难题，包您满意。
本公司拥有海外各大学样板无数，能完美还原海外各大学 Bachelor Diploma degree, Master Degree Diploma
1:1完美还原海外各大学毕业材料上的工艺：水印，阴影底纹，钢印LOGO烫金烫银，LOGO烫金烫银复合重叠。文字图案浮雕、激光镭射、紫外荧光、温感、复印防伪等防伪工艺。材料咨询办理、认证咨询办理请加学历顾问Q/微741003700
留信网认证的作用:
1:该专业认证可证明留学生真实身份
2:同时对留学生所学专业登记给予评定
3:国家专业人才认证中心颁发入库证书
4:这个认证书并且可以归档倒地方
5:凡事获得留信网入网的信息将会逐步更新到个人身份内，将在公安局网内查询个人身份证信息后，同步读取人才网入库信息
6:个人职称评审加20分
7:个人信誉贷款加10分
8:在国家人才网主办的国家网络招聘大会中纳入资料，供国家高端企业选择人才
Artificial Intelligence, Data and Competition – ČORBA – June 2024 OECD discus...
Artificial Intelligence, Data and Competition – ČORBA – June 2024 OECD discus...OECD Directorate for Financial and Enterprise Affairs
This presentation by Juraj Čorba, Chair of OECD Working Party on Artificial Intelligence Governance (AIGO), was made during the discussion “Artificial Intelligence, Data and Competition” held at the 143rd meeting of the OECD Competition Committee on 12 June 2024. More papers and presentations on the topic can be found at oe.cd/aicomp.
This presentation was uploaded with the author’s consent.
Carrer goals.pptx and their importance in real life
Career goals serve as a roadmap for individuals, guiding them toward achieving long-term professional aspirations and personal fulfillment. Establishing clear career goals enables professionals to focus their efforts on developing specific skills, gaining relevant experience, and making strategic decisions that align with their desired career trajectory. By setting both short-term and long-term objectives, individuals can systematically track their progress, make necessary adjustments, and stay motivated. Short-term goals often include acquiring new qualifications, mastering particular competencies, or securing a specific role, while long-term goals might encompass reaching executive positions, becoming industry experts, or launching entrepreneurial ventures.
Moreover, having well-defined career goals fosters a sense of purpose and direction, enhancing job satisfaction and overall productivity. It encourages continuous learning and adaptation, as professionals remain attuned to industry trends and evolving job market demands. Career goals also facilitate better time management and resource allocation, as individuals prioritize tasks and opportunities that advance their professional growth. In addition, articulating career goals can aid in networking and mentorship, as it allows individuals to communicate their aspirations clearly to potential mentors, colleagues, and employers, thereby opening doors to valuable guidance and support. Ultimately, career goals are integral to personal and professional development, driving individuals toward sustained success and fulfillment in their chosen fields.
The Intersection between Competition and Data Privacy – CAPEL – June 2024 OEC...
The Intersection between Competition and Data Privacy – CAPEL – June 2024 OEC...OECD Directorate for Financial and Enterprise Affairs
This presentation by Tim Capel, Director of the UK Information Commissioner’s Office Legal Service, was made during the discussion “The Intersection between Competition and Data Privacy” held at the 143rd meeting of the OECD Competition Committee on 13 June 2024. More papers and presentations on the topic can be found at oe.cd/ibcdp.
This presentation was uploaded with the author’s consent.
Why Psychological Safety Matters for Software Teams - ACE 2024 - Ben Linders.pdf
Psychological safety in teams is important; team members must feel safe and able to communicate and collaborate effectively to deliver value. It’s also necessary to build long-lasting teams since things will happen and relationships will be strained.
But, how safe is a team? How can we determine if there are any factors that make the team unsafe or have an impact on the team’s culture?
In this mini-workshop, we’ll play games for psychological safety and team culture utilizing a deck of coaching cards, The Psychological Safety Cards. We will learn how to use gamification to gain a better understanding of what’s going on in teams. Individuals share what they have learned from working in teams, what has impacted the team’s safety and culture, and what has led to positive change.
Different game formats will be played in groups in parallel. Examples are an ice-breaker to get people talking about psychological safety, a constellation where people take positions about aspects of psychological safety in their team or organization, and collaborative card games where people work together to create an environment that fosters psychological safety.
The Intersection between Competition and Data Privacy – KEMP – June 2024 OECD...
The Intersection between Competition and Data Privacy – KEMP – June 2024 OECD...OECD Directorate for Financial and Enterprise Affairs
This presentation by Katharine Kemp, Associate Professor at the Faculty of Law & Justice at UNSW Sydney, was made during the discussion “The Intersection between Competition and Data Privacy” held at the 143rd meeting of the OECD Competition Committee on 13 June 2024. More papers and presentations on the topic can be found at oe.cd/ibcdp.
This presentation was uploaded with the author’s consent.
BRIC_2024_2024-06-06-11:30-haunschild_archival_version.pdf
These are the slides of my presentation at BRIC 2024 about global science overlay maps using OpenAlex.
2024-05-30_meetup_devops_aix-marseille.pdf
Slides de notre meetup DevOps AixMarseille du 30 mai 2024 chez SmarTribune
Sujets: platform engineering / terragrunt / test containers
Recently uploaded (20)
Artificial Intelligence, Data and Competition – OECD – June 2024 OECD discussion
Artificial Intelligence, Data and Competition – OECD – June 2024 OECD discussion
Collapsing Narratives: Exploring Non-Linearity • a micro report by Rosie Wells
Collapsing Narratives: Exploring Non-Linearity • a micro report by Rosie Wells
The remarkable life of Sir Mokshagundam Visvesvaraya.pptx
The remarkable life of Sir Mokshagundam Visvesvaraya.pptx
Artificial Intelligence, Data and Competition – LIM – June 2024 OECD discussion
Artificial Intelligence, Data and Competition – LIM – June 2024 OECD discussion
Competition and Regulation in Professions and Occupations – ROBSON – June 202...
Competition and Regulation in Professions and Occupations – ROBSON – June 202...
Disaster Management project for holidays homework and other uses
Disaster Management project for holidays homework and other uses
The Intersection between Competition and Data Privacy – COLANGELO – June 2024...
The Intersection between Competition and Data Privacy – COLANGELO – June 2024...
Artificial Intelligence, Data and Competition – SCHREPEL – June 2024 OECD dis...
Artificial Intelligence, Data and Competition – SCHREPEL – June 2024 OECD dis...
Competition and Regulation in Professions and Occupations – OECD – June 2024 ...
Competition and Regulation in Professions and Occupations – OECD – June 2024 ...
Artificial Intelligence, Data and Competition – ČORBA – June 2024 OECD discus...
Artificial Intelligence, Data and Competition – ČORBA – June 2024 OECD discus...
Carrer goals.pptx and their importance in real life
Carrer goals.pptx and their importance in real life
The Intersection between Competition and Data Privacy – CAPEL – June 2024 OEC...
The Intersection between Competition and Data Privacy – CAPEL – June 2024 OEC...
Why Psychological Safety Matters for Software Teams - ACE 2024 - Ben Linders.pdf
Why Psychological Safety Matters for Software Teams - ACE 2024 - Ben Linders.pdf
The Intersection between Competition and Data Privacy – KEMP – June 2024 OECD...
The Intersection between Competition and Data Privacy – KEMP – June 2024 OECD...
BRIC_2024_2024-06-06-11:30-haunschild_archival_version.pdf
BRIC_2024_2024-06-06-11:30-haunschild_archival_version.pdf
Virtual Mapping in Virtual Memory
- 2. memory is any physical device capable of storing information temporarily like RAM (random access memory), or permanently, like ROM(read-only memory). Memory devices utilize integrated circuits and are used by operating systems, software, and hardware. Memory
- 3. Virtual Memory The virtual memory technique allows users to use more memory for a program than the real memory of a computer Virtual memory is the separation of logical memory from physical memory. This separation provides large virtual memory for programmers when only small physical memory is available.
- 4. Virtual Memory Virtual memory is used to give programmers the illusion that they have a very large memory even though the computer has a small main memory. It makes the task of programming easier because the programmer no longer needs to worry about the amount of physical memory available.
- 6. 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.
- 7. 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
- 8. VIRTUAL Memory Mapping The transformation of data from main memory to cache memory is called mapping. There are 3 main types of mapping: Associative Mapping Direct Mapping Set Associative Mapping
- 9. Associative Mapping The associative memory stores both address and data. The address value of 15 bits is 5 digit octal numbers and data is of 12 bits word in 4 digit octal number. A CPU address of 15 bits is placed in argument register and the associative memory is searched for matching address.
- 11. Direct Mapping The CPU address of 15 bits is divided into 2 fields. In this the 9 least significant bits constitute the index field and the remaining 6 bits constitute the tag field. The number of bits in index field is equal to the number of address bits required to access cache memory.
- 12. Set Associative Mapping The disadvantage of direct mapping is that two words with same index address can't reside in cache memory at the same time. This problem can be overcome by set associative mapping. In this we can store two or more words of memory under the same index address. Each data word is stored together with its tag and this forms a set.
- 13. Replacement Algorithms Data is continuously replaced with new data in the cache memory using replacement algorithms. Following are the 2 replacement algorithms used: FIFO - First in First out. Oldest item is replaced with the latest item. LRU - Least Recently Used. Item which is least recently used by CPU is removed.
- 14. 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
- 15. 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.
- 17. Thank you