DOCSLIB.ORG

Chapter 10: Virtual Memory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chapter 10: Virtual Memory Chapter 10: Virtual Memory Operating System Concepts – 10th Edition Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Chapter 10: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory Other Considerations Operating-System E$amples Operating System Concepts – 10th Edition 10.2 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Objectives Define &irtual memory and describe its benefits. Illustrate how pages are loaded into memory using demand paging( Apply the FIFO, optimal, and LRU page-replacement algorithms. Describe the working set of a process, and explain how it is related to program locality. Describe how Linux manages &irtual memory. Operating System Concepts – 10th Edition 10.3 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Background Although code needs to be in memory to be executed+ the entire program does not need to 'e. !nly small sections execute in any small window of time+ and Error code+ unusual routines, large data structures do not need to be in memory for the entire execution of the program What if we do not load the entire program into memory? Program no longer constrained 'y limits of physical memory Each program takes less memory while running implies more programs run at the same time )ncreased CPU utilization and throughput with no increase in response time or turnaround time Less I/O needed to load or swap programs into memory -> each user program runs faster Operating System Concepts – 10th Edition 10.4 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Virtual memory Virtual memory – separation of user logical memory from physical memory Only part of the program and its data needs to be in memory for execution ,ogical address space can therefore be much larger than physical address space Also allows address spaces to be shared by several processes Allows for more efficient process creation More programs running concurrently ,ess I/O needed to load or swap processes Operating System Concepts – 10th Edition 10.5 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Virtual memory (Cont.) Virtual address space 2 logical view of how process is stored in memory -sually starts at address 0, contiguous addresses until end of space 58-bit virtual addresses implies 7848 bytes of virtual memory Physical memory is still organized into page frames MMU must map &irtual to physical 9irtual memory can be implemented via: Demand paging Demand segmentation Operating System Concepts – 10th Edition 10. Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Virtual Address Translation Translation of a ;7-'it virtual address to a 30-bit physical address: Virtual address 31 30 29 28 27 15 14 13 12 11 10 9 8 3 2 1 0 Virtual page number Page offset Translation 29 28 27 15 14 13 12 11 10 9 8 3 2 1 0 Physical page number Page offset Physical address Operating System Concepts – 10th Edition 10.! Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Virtual Memory That is Larger Than Physical Memory Operating System Concepts – 10th Edition 10." Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Translation Using Just a Page Table Operating System Concepts – 10th Edition 10.# Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Virtual-address Space "tandard format <#LF= has logical address space for stack to start at Ma$ logical address and grow >down” *hile heap grows >up? Maximizes address space use -nused address space bet*een the t*o is hole @o physical memory needed until heap or stack gro*s to a given new page #nables sparse address spaces *ith holes left for growth+ dynamically linked libraries, etc "ystem libraries shared via mapping into &irtual address space "hared memory by mapping pages read- *rite into &irtual address space Pages can 'e shared during fork()+ speeding process creation Operating System Concepts – 10th Edition 10.10 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Shared Library Using Virtual Memory Operating System Concepts – 10th Edition 10.11 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Demand Paging )n demand paging: pages are brought into memory only *hen needed: Less )0! needed+ no unnecessary )0! Less memory needed Faster response More users )f a page is needed+ it implies a reference made to it invalid reference abort not-in-memory 'ring into memory $azy s&apper 2 ne&er brings a page into memory unless page *ill be needed "*apper that deals *ith pages is called a pager Operating System Concepts – 10th Edition 10.12 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Basic Concepts With swapping+ pager guesses which pages will be used 'efore s*apping out again )nstead, pager brings in only those pages into memory How to determine that set of pages? Need new MMU functionality to implement demand paging )f pages needed are already memory resident No diBerent from non demand-paging )f page needed and not memory resident Need to detect and load the page into memory from storage Without changing program behavior Without programmer needing to change code Operating System Concepts – 10th Edition 10.13 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Valid-Invalid Bit With each page table entry a valid–invalid bit is associated <' in-memory 2 memory resident+ i not-in-memory= )nitially valid–invalid bit is set to i on all entries #$ample of a page table snapshot: During MMU address translation, if valid–invalid bit in page table entry is i page fault Operating System Concepts – 10th Edition 10.14 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Page Table When Some Pages Are Not in Main Memory Operating System Concepts – 10th Edition 10.15 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Steps in Handling Page Fault C( If there is a reference to a page, the first reference to that page will trap to operating system, i(+e. it is a Page fault 7( Operating system looks at another table to decide: Invalid reference abort Just not in memory ;( Find free frame 5( "*ap page into frame via scheduled disk operation E( Reset tables to indicate page now in memory Set validation 'it F ' G( Restart the instruction that caused the page fault Operating System Concepts – 10th Edition 10.1 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Steps in Handling a Page Fault (Cont.) Operating System Concepts – 10th Edition 10.1! Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Aspects of Demand Paging #xtreme case 2 start process *ith no pages in memory !" sets instruction pointer to first instruction of process, non-memory-resident -> page fault And for every other process pages on first access )ure demand paging Actually, a given instruction could access multiple pages -1 multiple page faults Consider fetch and decode of instruction *hich adds 7 numbers from memory and stores result back to memory Pain decreased because of locality o( reference Aard*are support needed for demand paging Page table *ith valid 0 invalid 'it "econdary memory <swap device *ith s&ap space= )nstruction restart Operating System Concepts – 10th Edition 10.1" Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Instruction Restart Consider an instruction that could access several different locations Block move Auto increment/decrement location Restart the *hole operation? What if source and destination overlap. Operating System Concepts – 10th Edition 10.1# Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Free-Frame List When a page fault occurs, the operating system must 'ring the desired page from secondary storage into main memory. Most operating systems maintain a free-frame list -- a pool of free frames for satisfying such requests. !perating system typically allocate free frames using a technique known as zero-fill-on-demand -- the content of the frames zeroed-out before being allocated( When a system starts up+ all available memory is placed on the free-frame list. Operating System Concepts – 10th Edition 10.20 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Stages in Demand Paging – Worse Case C( Trap to the operating system 7( Save the user registers and process state ;( Determine that the interrupt *as a page fault 5( Check that the page reference was legal and determine the location of the page on the disk E( Issue a read from the disk to a free frame: C( Wait in a Hueue for this device until the read request is serviced 7( Wait for the device seek and/or latency time ;( Begin the transfer of the page to a free frame Operating System Concepts – 10th Edition 10.21 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Stages in Demand Paging (Cont.) G( While waiting, allocate the CPU to some other user I( Receive an interrupt from the disk )0O subsystem (I/O completed= 6( Save the registers and process state for the other user J( Determine that the interrupt was from the disk C4( Correct the page table and other tables to show page is now in memory CC( Wait for the CPU to be allocated to this process again C7( Restore the user registers, process state, and new page table, and then resume the interrupted instruction Operating System Concepts – 10th Edition 10.22 Silberschatz, Galvin and Gagne ©2018, revised by S. Weiss 2020 Performance of Demand Paging Three major activities Service the interrupt – careful coding means just several hundred instructions needed Read the page – lots of time Restart the process – again just a small amount of time Page Fault Rate 0 p C if p F 0 no page faults if p F 1, every reference is a fault #Bective Access Time (EAT= EAT F (1 – p) x memory access L p (page fault overhead L s*ap page out L s*ap page in = Operating System Concepts – 10th Edition 10.23 Silberschatz, Galvin and Gagne ©2018, revised by S.
Load more

Recommended publications
  • Virtual Memory
    Chapter 4 Virtual Memory Linux processes execute in a virtual environment that makes it appear as if each process had the entire address space of the CPU available to itself. This virtual address space extends from address 0 all the way to the maximum address. On a 32-bit platform, such as IA-32, the maximum address is 232 − 1or0xffffffff. On a 64-bit platform, such as IA-64, this is 264 − 1or0xffffffffffffffff. While it is obviously convenient for a process to be able to access such a huge ad- dress space, there are really three distinct, but equally important, reasons for using virtual memory. 1. Resource virtualization. On a system with virtual memory, a process does not have to concern itself with the details of how much physical memory is available or which physical memory locations are already in use by some other process. In other words, virtual memory takes a limited physical resource (physical memory) and turns it into an infinite, or at least an abundant, resource (virtual memory). 2. Information isolation. Because each process runs in its own address space, it is not possible for one process to read data that belongs to another process. This improves security because it reduces the risk of one process being able to spy on another pro- cess and, e.g., steal a password. 3. Fault isolation. Processes with their own virtual address spaces cannot overwrite each other’s memory. This greatly reduces the risk of a failure in one process trig- gering a failure in another process. That is, when a process crashes, the problem is generally limited to that process alone and does not cause the entire machine to go down.
    [Show full text]
  • The Case for Compressed Caching in Virtual Memory Systems
    THE ADVANCED COMPUTING SYSTEMS ASSOCIATION The following paper was originally published in the Proceedings of the USENIX Annual Technical Conference Monterey, California, USA, June 6-11, 1999 The Case for Compressed Caching in Virtual Memory Systems _ Paul R. Wilson, Scott F. Kaplan, and Yannis Smaragdakis aUniversity of Texas at Austin © 1999 by The USENIX Association All Rights Reserved Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. For more information about the USENIX Association: Phone: 1 510 528 8649 FAX: 1 510 548 5738 Email: [email protected] WWW: http://www.usenix.org The Case for Compressed Caching in Virtual Memory Systems Paul R. Wilson, Scott F. Kaplan, and Yannis Smaragdakis Dept. of Computer Sciences University of Texas at Austin Austin, Texas 78751-1182 g fwilson|sfkaplan|smaragd @cs.utexas.edu http://www.cs.utexas.edu/users/oops/ Abstract In [Wil90, Wil91b] we proposed compressed caching for virtual memory—storing pages in compressed form Compressed caching uses part of the available RAM to in a main memory compression cache to reduce disk pag- hold pages in compressed form, effectively adding a new ing. Appel also promoted this idea [AL91], and it was level to the virtual memory hierarchy. This level attempts evaluated empirically by Douglis [Dou93] and by Russi- to bridge the huge performance gap between normal (un- novich and Cogswell [RC96]. Unfortunately Douglis’s compressed) RAM and disk.
    [Show full text]
  • Memory Protection at Option
    Memory Protection at Option Application-Tailored Memory Safety in Safety-Critical Embedded Systems – Speicherschutz nach Wahl Auf die Anwendung zugeschnittene Speichersicherheit in sicherheitskritischen eingebetteten Systemen Der Technischen Fakultät der Universität Erlangen-Nürnberg zur Erlangung des Grades Doktor-Ingenieur vorgelegt von Michael Stilkerich Erlangen — 2012 Als Dissertation genehmigt von der Technischen Fakultät Universität Erlangen-Nürnberg Tag der Einreichung: 09.07.2012 Tag der Promotion: 30.11.2012 Dekan: Prof. Dr.-Ing. Marion Merklein Berichterstatter: Prof. Dr.-Ing. Wolfgang Schröder-Preikschat Prof. Dr. Michael Philippsen Abstract With the increasing capabilities and resources available on microcontrollers, there is a trend in the embedded industry to integrate multiple software functions on a single system to save cost, size, weight, and power. The integration raises new requirements, thereunder the need for spatial isolation, which is commonly established by using a memory protection unit (MPU) that can constrain access to the physical address space to a fixed set of address regions. MPU-based protection is limited in terms of available hardware, flexibility, granularity and ease of use. Software-based memory protection can provide an alternative or complement MPU-based protection, but has found little attention in the embedded domain. In this thesis, I evaluate qualitative and quantitative advantages and limitations of MPU-based memory protection and software-based protection based on a multi-JVM. I developed a framework composed of the AUTOSAR OS-like operating system CiAO and KESO, a Java implementation for deeply embedded systems. The framework allows choosing from no memory protection, MPU-based protection, software-based protection, and a combination of the two.
    [Show full text]
  • Virtual Memory
    Virtual Memory Copyright ©: University of Illinois CS 241 Staff 1 Address Space Abstraction n Program address space ¡ All memory data ¡ i.e., program code, stack, data segment n Hardware interface (physical reality) ¡ Computer has one small, shared memory How can n Application interface (illusion) we close this gap? ¡ Each process wants private, large memory Copyright ©: University of Illinois CS 241 Staff 2 Address Space Illusions n Address independence ¡ Same address can be used in different address spaces yet remain logically distinct n Protection ¡ One address space cannot access data in another address space n Virtual memory ¡ Address space can be larger than the amount of physical memory on the machine Copyright ©: University of Illinois CS 241 Staff 3 Address Space Illusions: Virtual Memory Illusion Reality Giant (virtual) address space Many processes sharing Protected from others one (physical) address space (Unless you want to share it) Limited memory More whenever you want it Today: An introduction to Virtual Memory: The memory space seen by your programs! Copyright ©: University of Illinois CS 241 Staff 4 Multi-Programming n Multiple processes in memory at the same time n Goals 1. Layout processes in memory as needed 2. Protect each process’s memory from accesses by other processes 3. Minimize performance overheads 4. Maximize memory utilization Copyright ©: University of Illinois CS 241 Staff 5 OS & memory management n Main memory is normally divided into two parts: kernel memory and user memory n In a multiprogramming system, the “user” part of main memory needs to be divided to accommodate multiple processes. n The user memory is dynamically managed by the OS (known as memory management) to satisfy following requirements: ¡ Protection ¡ Relocation ¡ Sharing ¡ Memory organization (main mem.
    [Show full text]
  • Extracting Compressed Pages from the Windows 10 Virtual Store WHITE PAPER | EXTRACTING COMPRESSED PAGES from the WINDOWS 10 VIRTUAL STORE 2
    white paper Extracting Compressed Pages from the Windows 10 Virtual Store WHITE PAPER | EXTRACTING COMPRESSED PAGES FROM THE WINDOWS 10 VIRTUAL STORE 2 Abstract Windows 8.1 introduced memory compression in August 2013. By the end of 2013 Linux 3.11 and OS X Mavericks leveraged compressed memory as well. Disk I/O continues to be orders of magnitude slower than RAM, whereas reading and decompressing data in RAM is fast and highly parallelizable across the system’s CPU cores, yielding a significant performance increase. However, this came at the cost of increased complexity of process memory reconstruction and thus reduced the power of popular tools such as Volatility, Rekall, and Redline. In this document we introduce a method to retrieve compressed pages from the Windows 10 Memory Manager Virtual Store, thus providing forensics and auditing tools with a way to retrieve, examine, and reconstruct memory artifacts regardless of their storage location. Introduction Windows 10 moves pages between physical memory and the hard disk or the Store Manager’s virtual store when memory is constrained. Universal Windows Platform (UWP) applications leverage the Virtual Store any time they are suspended (as is the case when minimized). When a given page is no longer in the process’s working set, the corresponding Page Table Entry (PTE) is used by the OS to specify the storage location as well as additional data that allows it to start the retrieval process. In the case of a page file, the retrieval is straightforward because both the page file index and the location of the page within the page file can be directly retrieved.
    [Show full text]
  • HALO: Post-Link Heap-Layout Optimisation
    HALO: Post-Link Heap-Layout Optimisation Joe Savage Timothy M. Jones University of Cambridge, UK University of Cambridge, UK [email protected] [email protected] Abstract 1 Introduction Today, general-purpose memory allocators dominate the As the gap between memory and processor speeds continues landscape of dynamic memory management. While these so- to widen, efficient cache utilisation is more important than lutions can provide reasonably good behaviour across a wide ever. While compilers have long employed techniques like range of workloads, it is an unfortunate reality that their basic-block reordering, loop fission and tiling, and intelligent behaviour for any particular workload can be highly subop- register allocation to improve the cache behaviour of pro- timal. By catering primarily to average and worst-case usage grams, the layout of dynamically allocated memory remains patterns, these allocators deny programs the advantages of largely beyond the reach of static tools. domain-specific optimisations, and thus may inadvertently Today, when a C++ program calls new, or a C program place data in a manner that hinders performance, generating malloc, its request is satisfied by a general-purpose allocator unnecessary cache misses and load stalls. with no intimate knowledge of what the program does or To help alleviate these issues, we propose HALO: a post- how its data objects are used. Allocations are made through link profile-guided optimisation tool that can improve the fixed, lifeless interfaces, and fulfilled by
    [Show full text]
  • Virtual Memory - Paging
    Virtual memory - Paging Johan Montelius KTH 2020 1 / 32 The process code heap (.text) data stack kernel 0x00000000 0xC0000000 0xffffffff Memory layout for a 32-bit Linux process 2 / 32 Segments - a could be solution Processes in virtual space Address translation by MMU (base and bounds) Physical memory 3 / 32 one problem Physical memory External fragmentation: free areas of free space that is hard to utilize. Solution: allocate larger segments ... internal fragmentation. 4 / 32 another problem virtual space used code We’re reserving physical memory that is not used. physical memory not used? 5 / 32 Let’s try again It’s easier to handle fixed size memory blocks. Can we map a process virtual space to a set of equal size blocks? An address is interpreted as a virtual page number (VPN) and an offset. 6 / 32 Remember the segmented MMU MMU exception no virtual addr. offset yes // < within bounds index + physical address segment table 7 / 32 The paging MMU MMU exception virtual addr. offset // VPN available ? + physical address page table 8 / 32 the MMU exception exception virtual address within bounds page available Segmentation Paging linear address physical address 9 / 32 a note on the x86 architecture The x86-32 architecture supports both segmentation and paging. A virtual address is translated to a linear address using a segmentation table. The linear address is then translated to a physical address by paging. Linux and Windows do not use use segmentation to separate code, data nor stack. The x86-64 (the 64-bit version of the x86 architecture) has dropped many features for segmentation.
    [Show full text]
  • Chapter 4 Memory Management and Virtual Memory Asst.Prof.Dr
    Chapter 4 Memory management and Virtual Memory Asst.Prof.Dr. Supakit Nootyaskool IT-KMITL Object • To discuss the principle of memory management. • To understand the reason that memory partitions are importance for system organization. • To describe the concept of Paging and Segmentation. 4.1 Difference in main memory in the system • The uniprogramming system (example in DOS) allows only a program to be present in memory at a time. All resources are provided to a program at a time. Example in a memory has a program and an OS running 1) Operating system (on Kernel space) 2) A running program (on User space) • The multiprogramming system is difference from the mentioned above by allowing programs to be present in memory at a time. All resource must be organize and sharing to programs. Example by two programs are in the memory . 1) Operating system (on Kernel space) 2) Running programs (on User space + running) 3) Programs are waiting signals to execute in CPU (on User space). The multiprogramming system uses memory management to organize location to the programs 4.2 Memory management terms Frame Page Segment 4.2 Memory management terms Frame Page A fixed-lengthSegment block of main memory. 4.2 Memory management terms Frame Page A fixed-length block of data that resides in secondary memory. A page of data may temporarily beSegment copied into a frame of main memory. A variable-lengthMemory management block of data that residesterms in secondary memory. A segment may temporarily be copied into an available region of main memory or the segment may be divided into pages which can be individuallyFrame copied into mainPage memory.
    [Show full text]
  • X86 Memory Protection and Translation
    2/5/20 COMP 790: OS Implementation COMP 790: OS Implementation Logical Diagram Binary Memory x86 Memory Protection and Threads Formats Allocators Translation User System Calls Kernel Don Porter RCU File System Networking Sync Memory Device CPU Today’s Management Drivers Scheduler Lecture Hardware Interrupts Disk Net Consistency 1 Today’s Lecture: Focus on Hardware ABI 2 1 2 COMP 790: OS Implementation COMP 790: OS Implementation Lecture Goal Undergrad Review • Understand the hardware tools available on a • What is: modern x86 processor for manipulating and – Virtual memory? protecting memory – Segmentation? • Lab 2: You will program this hardware – Paging? • Apologies: Material can be a bit dry, but important – Plus, slides will be good reference • But, cool tech tricks: – How does thread-local storage (TLS) work? – An actual (and tough) Microsoft interview question 3 4 3 4 COMP 790: OS Implementation COMP 790: OS Implementation Memory Mapping Two System Goals 1) Provide an abstraction of contiguous, isolated virtual Process 1 Process 2 memory to a program Virtual Memory Virtual Memory 2) Prevent illegal operations // Program expects (*x) – Prevent access to other application or OS memory 0x1000 Only one physical 0x1000 address 0x1000!! // to always be at – Detect failures early (e.g., segfault on address 0) // address 0x1000 – More recently, prevent exploits that try to execute int *x = 0x1000; program data 0x1000 Physical Memory 5 6 5 6 1 2/5/20 COMP 790: OS Implementation COMP 790: OS Implementation Outline x86 Processor Modes • x86
    [Show full text]
  • Operating Systems
    UC Santa Barbara Operating Systems Christopher Kruegel Department of Computer Science UC Santa Barbara http://www.cs.ucsb.edu/~chris/ CS 170 Info UC Santa Barbara • Web page: http://www.cs.ucsb.edu/~chris/cs170/index.html • Mailing lists (one for class, one for instructors) cs170-users – used to disseminate information and ask fellow classmates cs170-admin – use to reach TA and me 2 Requirements UC Santa Barbara • The course requirements include – several projects – a midterm and a final exam • The projects (and exams) are individual efforts • The final grade will be determined according to the following weight – projects: 50% – exams: 50% • Class participation and non-graded quizzes 3 Lab Projects UC Santa Barbara ~5 programming assignments • Shell (system calls) • Threads (parallel execution, scheduling) • Synchronization (semaphores, …) • Memory (virtual memory, shared regions, …) • File systems 4 Material UC Santa Barbara • The course will adopt the following book: Andrew S. Tanenbaum and Albert S. Woodhull Operating Systems (Design and Implementation) 3rd Edition, Prentice-Hall, 2006 • The set of assignments will be updated during the course • Additional material (slides) is provided on the class Web page 5 Operating Systems UC Santa Barbara • Let us do amazing things … – allow you to run multiple programs at the same time – protect all other programs when one app crashes – allow programs to use more memory that your computer has RAM – allow you to plug in a device and just use it (well, most of the time) – protects your data from
    [Show full text]
  • Demand Paging from the OS Perspective
    HW 3 due 11/10 LLeecctuturree 1122:: DDeemmaanndd PPaaggiinngg CSE 120: Principles of Operating Systems Alex C. Snoeren MMeemmoorryy MMaannaaggeemmeenntt Last lecture on memory management: Goals of memory management ◆ To provide a convenient abstraction for programming ◆ To allocate scarce memory resources among competing processes to maximize performance with minimal overhead Mechanisms ◆ Physical and virtual addressing (1) ◆ Techniques: Partitioning, paging, segmentation (1) ◆ Page table management, TLBs, VM tricks (2) Policies ◆ Page replacement algorithms (3) 2 CSE 120 – Lecture 12 LLeecctuturree OOvveerrvviieeww Review paging and page replacement Survey page replacement algorithms Discuss local vs. global replacement Discuss thrashing 3 CSE 120 – Lecture 12 LLooccaalliityty All paging schemes depend on locality ◆ Processes reference pages in localized patterns Temporal locality ◆ Locations referenced recently likely to be referenced again Spatial locality ◆ Locations near recently referenced locations are likely to be referenced soon Although the cost of paging is high, if it is infrequent enough it is acceptable ◆ Processes usually exhibit both kinds of locality during their execution, making paging practical 4 CSE 120 – Lecture 12 DDeemmaanndd PPaaggiinngg ((OOSS)) Recall demand paging from the OS perspective: ◆ Pages are evicted to disk when memory is full ◆ Pages loaded from disk when referenced again ◆ References to evicted pages cause a TLB miss » PTE was invalid, causes fault ◆ OS allocates a page frame, reads
    [Show full text]
  • Virtual Memorymemory
    ChapterChapter 9:9: VirtualVirtual MemoryMemory ChapterChapter 9:9: VirtualVirtual MemoryMemory ■ Background ■ Demand Paging ■ Process Creation ■ Page Replacement ■ Allocation of Frames ■ Thrashing ■ Demand Segmentation ■ Operating System Examples Operating System Concepts 9.2 Silberschatz, Galvin and Gagne ©2009 BackgroundBackground ■ Virtual memory – separation of user logical memory from physical memory. ● Only part of a program needs to be in memory for execution (can really execute only one instruction at a time) Only have to load code that is needed Less I/O, so potential performance gain More programs in memory, so better resource allocation and throughput ● Logical address space can therefore be much larger than physical address space. Programs can be larger than memory Less management required by programmers ● Need to allow pages to be swapped in and out ■ Virtual memory can be implemented via: ● Demand paging (for both paging and swapping) ● Demand segmentation Operating System Concepts 9.3 Silberschatz, Galvin and Gagne ©2009 VirtualVirtual MemoryMemory ThatThat isis LargerLarger ThanThan PhysicalPhysical MemoryMemory Operating System Concepts 9.4 Silberschatz, Galvin and Gagne ©2009 AA Process’sProcess’s Virtual-addressVirtual-address SpaceSpace Operating System Concepts 9.5 Silberschatz, Galvin and Gagne ©2009 VirtualVirtual MemoryMemory hashas ManyMany UsesUses ■ In addition to separating logical from physical memory, virtual memory can enable processes to share memory ■ Provides following benefits: ● Can share system
    [Show full text]