DOCSLIB.ORG

Opera`Ng Systems CMPSCI 377 Virtual Memory & Paging

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Opera`Ng Systems CMPSCI 377 Virtual Memory & Paging Operang Systems CMPSCI 377 Virtual Memory & Paging Emery Berger and Mark Corner University of Massachuse9s Amherst Virtual vs. Physical Memory . Apps don’t access physical memory – Well, not directly . Apps use virtual memory – Addresses start at 0 – One level of indirec?on – Address you see is not “real” address . Any ideas why? 2 Memory Pages . Programs use memory as individual bytes . OS manages groups oF bytes: pages – typically 4kB, 8kB – Why? (think Tetris with all squares) – Applies this to virtual and physical memory • Physical pages usually called frames A Mapping Virtual to Physical . Note this is simplified and the data here includes the heap, not the typical data segment… 4 Why Virtual Memory? . Why? – Simpler • Everyone gets illusion oF whole address space – Isolaon • Every process protected From every other – Op&mizaon • Reduces space requirements 5 Typical Virtual Memory Layout . Some things grow – Must leave room! . Mmap and heap spaces – Mmap increases mmap – Brk increases heap . Other layouts possible Quick Quiz! . Are arrays con&nuous in memory? – Physical memory? – Virtual memory? . Where does the code For a program live? Memory Management Unit . Programs issue loads and stores . What kind oF addresses are these? . MMU Translates virtual to physical addresses – Maintains page table (big hash table): – Almost always in HW… Why? Virtual Physical Program Address MMU Address Memory Page Table Page Tables . Table oF translaons – virtual pages -> physical pages . One page table per process . One page table entry per virtual page . How? – Programs issue virtual address – Find virtual page (how?) – Lookup physical page, add offset Page Table Entries . Do all virtual pages -> physical page? – Valid and Invalid bits . PTEs have lots oF other inFormaon – For instance some pages can only be read Address Transla?on . Powers oF 2: – Virtual address space: size 2^m – Page size 2^n . Page#: High m-n bits oF virtual address . Lower n bits select offset in page 11 Quick Ac?vity . How much mem does a page table need? – 4kB pages, 32 bit address space – page table entry (PTE) uses 4 bytes . 2^32/2^12*4=2^22 bytes=4MB – Is this a problem? – Isn’t this per process? – What about a 64 bit address space? . Any ideas how to fix this? Mul?-Level Page Tables . Use a mul&-level page table A A Level 0 Table Level 1 Table A Level 1 Table Quick Ac?vity . How much mem does a page table need? – 4kB pages, 32 bit address space – Two level page table – 20bits = 10 bits each level – page table entry (PTE) uses 4 bytes – Only first page oF program is valid . 2^10*4+2^10*4=2^13 bytes=8kB . Isn’t this slow? Transla?on Lookaside Buffer (TLB) . TLB: Fast, Fully associave memory – Caches page table entries – Stores page numbers (key) and Frame (value) in which they are stored . Assump&on: locality oF reFerence – Locality in memory accesses = locality in address translaon . TLB sizes: 8 to 2048 entries – Powers oF 2 simplifies translaon oF virtual to physical addresses 15 Virtual Memory is an Illusion! . How much memory does a process have? – Do all processes have this? . Key idea: use RAM as cache For disk – OS transparently moves pages . Requires locality: – Working set must fit in RAM • memory reFerenced recently – If not: thrashing (nothing but disk traffic) Paging 17 Paging + Locality . Most programs obey 90/10 “rule” – 90% oF &me spent accessing 10% oF A memory A . Exploit this rule: B – Only keep “live” parts B of process in memory 18 Key Policy Decisions . Two key ques&ons: (For any cache): – When do we read page From disk? – When do we write page to disk? 19 Reading Pages . Read on-demand: – OS loads page on its first reFerence – May Force an evic&on oF page in RAM – Pause while loading page = page Fault . Can also perForm pre-paging: – OS guesses which page will next be needed, and begins loading it . Most systems just do demand paging . What about writes? 20 Demand Paging . On every reFerence, check iF page is in memory (resident bit in page table) – Who is doing this? . If not: trap to OS – How does this work in HW? . OS: – Selects vic&m page to be replaced – Writes vic&m page iF necessary, marks non-resident – Begins loading new page From disk – OS can switch to another process • more on this later 21 Swap Space . Swap space = where vic&m pages go – Par&&on or special file reserved on disk . Size oF reserved swap space limits what? 22 Tricks with Page Tables . Do all pages oF memory end up in swap? . Parts oF address space mapped into files – see man pages For mmap Overview . A Day in the LiFe oF a Page – Allocaon – Use – Evicon – Reuse . Terms: Resident and Non-resident 24 A Day in the Life of a Page Allocate some memory char * x = new char[16]; 0x40001000 0x40001040 → 0x4000104F virtual memory layout 25 A Day in the Life of a Page Update page tables char * x = new char[16]; 0x40001000 0x40001040 → 0x4000104F virtual physical memory memory layout layout 26 A Day in the Life of a Page Write contents – dirty page strcpy(x, “hello”); 0x40001000 0x40001040 → 0x4000104F virtual physical memory memory layout layout 27 A Day in the Life of a Page Other processes fill up memory… virtual physical memory memory layout layout 28 A Day in the Life of a Page Forcing our page to be evicted (paged out) virtual physical swap memory memory space layout layout (disk) 29 A Day in the Life of a Page Now page nonresident & protected virtual physical swap memory memory space layout layout (disk) 30 A Day in the Life of a Page Touch page – swap it in y[0] = x[0]; 0x40001000 0x40001040 → 0x4000104F virtual physical swap memory memory space layout layout (disk) 31 A Day in the Life of a Page Touch page – swap it in y[0] = x[0]; 0x40001000 0x40001040 → 0x4000104F virtual physical swap memory memory space layout layout (disk) 32 Tricks with Page Tables: Sharing . Paging allows sharing oF memory across processes – Reduces memory requirements . Shared stuff includes code, data – Code typically R/O 33 Tricks with Page Tables: COW . Copy on write (COW) – Just copy page tables – Make all pages read-only . What iF process changes mem? . All processes are created this way! Alloca?ng Pages . ul&mately From sbrk or mmap . Sbrk increases # oF valid pages – Increases the heap . Mmap maps address space to file – Increases the mmap space . Oddity: – Allocators can use either mmap or brk to get pages – You will use mmap . What does mmap /dev/zero mean? – Think about COW Overview . Replacement policies – Comparison 36 Cost of Paging . Usually in algorithms, we pick algorithm with best asympto&c worst-case – Paging: worst-case analysis useless! – Easy to construct adversary: every page requires page Fault A, B, C, D, E, F, G, H, I, J, A... size of available memory 37 Cost of Paging . Worst-case analysis – useless – Easy to construct adversary example: every page requires page Fault A A, B, C, D, E, F, G, H, I, J, A... size of available memory 38 Cost of Paging . Worst-case analysis – useless – Easy to construct adversary example: every page requires page Fault A B A, B, C, D, E, F, G, H, I, J, A... size of available memory 39 Cost of Paging . Worst-case analysis – useless – Easy to construct adversary example: every page requires page Fault A B C A, B, C, D, E, F, G, H, I, J, A... size of available memory 40 Cost of Paging . Worst-case analysis – useless – Easy to construct adversary example: every page requires page Fault A B C D A, B, C, D, E, F, G, H, I, J, A... size of available memory 41 Cost of Paging . Worst-case analysis – useless – Easy to construct adversary example: every page requires page Fault A B C D E A, B, C, D, E, F, G, H, I, J, A... size of available memory 42 Cost of Paging . Worst-case analysis – useless – Easy to construct adversary example: every page requires page Fault F B C D E A, B, C, D, E, F, G, H, I, J, A... size of available memory 43 Cost of Paging . Worst-case analysis – useless – Easy to construct adversary example: every page requires page Fault F G H I J A, B, C, D, E, F, G, H, I, J, A... size of available memory 44 Op?mal Replacement (MIN/OPT) . Evict page accessed Furthest in Future – Op&mal page replacement algorithm • Invented by Belady (“MIN”), a.k.a. “OPT” . Provably op&mal policy – Just one small problem... Requires predic&ng the Future – UseFul point oF comparison • How Far From op&mal 45 Quick Ac?vity: OPT sequence oF page accesses contents oF page Frames . Page Faults: 5 46 Least-Recently Used (LRU) . Evict page not used in longest &me (least-recently used) – Approximates OPT • If recent past ≈ predictor oF Future – Variant used in all real operang systems 47 Quick Ac?vity: LRU eXample . Page Faults: ? 48 LRU eXample . Page Faults: 5 49 LRU, eXample II . Page Faults: ? 50 LRU, eXample II . Page Faults: 12! – Loop: well-known worst-case For LRU 51 Most-Recently Used (MRU) . Evict most-recently used page . Shines For LRU’s worst-case: loop that exceeds RAM size A, B, C, D, A, B, C, D, ... size of available memory 52 Most-Recently Used (MRU) . Evict most-recently used page . Shines For LRU’s worst-case: loop that exceeds RAM size A A, B, C, D, A, B, C, D, ... size of available memory 53 Most-Recently Used (MRU) .
Load more

Recommended publications
  • Overcoming Traditional Problems with OS Huge Page Management
    MEGA: Overcoming Traditional Problems with OS Huge Page Management Theodore Michailidis Alex Delis Mema Roussopoulos University of Athens University of Athens University of Athens Athens, Greece Athens, Greece Athens, Greece [email protected] [email protected] [email protected] ABSTRACT KEYWORDS Modern computer systems now feature memory banks whose Huge pages, Address Translation, Memory Compaction aggregate size ranges from tens to hundreds of GBs. In this context, contemporary workloads can and do often consume ACM Reference Format: Theodore Michailidis, Alex Delis, and Mema Roussopoulos. 2019. vast amounts of main memory. This upsurge in memory con- MEGA: Overcoming Traditional Problems with OS Huge Page Man- sumption routinely results in increased virtual-to-physical agement. In The 12th ACM International Systems and Storage Con- address translations, and consequently and more importantly, ference (SYSTOR ’19), June 3–5, 2019, Haifa, Israel. ACM, New York, more translation misses. Both of these aspects collectively NY, USA, 11 pages. https://doi.org/10.1145/3319647.3325839 do hamper the performance of workload execution. A solu- tion aimed at dramatically reducing the number of address translation misses has been to provide hardware support for 1 INTRODUCTION pages with bigger sizes, termed huge pages. In this paper, we Computer memory capacities have been increasing sig- empirically demonstrate the benefits and drawbacks of using nificantly over the past decades, leading to the development such huge pages. In particular, we show that it is essential of memory hungry workloads that consume vast amounts for modern OS to refine their software mechanisms to more of main memory. This upsurge in memory consumption rou- effectively manage huge pages.
    [Show full text]
  • Asynchronous Page Faults Aix Did It Red Hat Author Gleb Natapov August 10, 2010
    Asynchronous page faults Aix did it Red Hat Author Gleb Natapov August 10, 2010 Abstract Host memory overcommit may cause guest memory to be swapped. When guest vcpu access memory swapped out by a host its execution is suspended until memory is swapped back. Asynchronous page fault is a way to try and use guest vcpu more efficiently by allowing it to execute other tasks while page is brought back into memory. Part I How KVM Handles Guest Memory and What Inefficiency it Has With Regards to Host Swapping Mapping guest memory into host memory But we do it on demand Page fault happens on first guest access What happens on a page fault? 1 VMEXIT 2 kvm mmu page fault() 3 gfn to pfn() 4 get user pages fast() no previously mapped page and no swap entry found empty page is allocated 5 page is added into shadow/nested page table What happens on a page fault? 1 VMEXIT 2 kvm mmu page fault() 3 gfn to pfn() 4 get user pages fast() no previously mapped page and no swap entry found empty page is allocated 5 page is added into shadow/nested page table What happens on a page fault? 1 VMEXIT 2 kvm mmu page fault() 3 gfn to pfn() 4 get user pages fast() no previously mapped page and no swap entry found empty page is allocated 5 page is added into shadow/nested page table What happens on a page fault? 1 VMEXIT 2 kvm mmu page fault() 3 gfn to pfn() 4 get user pages fast() no previously mapped page and no swap entry found empty page is allocated 5 page is added into shadow/nested page table What happens on a page fault? 1 VMEXIT 2 kvm mmu page fault() 3 gfn to pfn()
    [Show full text]
  • What Is an Operating System III 2.1 Compnents II an Operating System
    Page 1 of 6 What is an Operating System III 2.1 Compnents II An operating system (OS) is software that manages computer hardware and software resources and provides common services for computer programs. The operating system is an essential component of the system software in a computer system. Application programs usually require an operating system to function. Memory management Among other things, a multiprogramming operating system kernel must be responsible for managing all system memory which is currently in use by programs. This ensures that a program does not interfere with memory already in use by another program. Since programs time share, each program must have independent access to memory. Cooperative memory management, used by many early operating systems, assumes that all programs make voluntary use of the kernel's memory manager, and do not exceed their allocated memory. This system of memory management is almost never seen any more, since programs often contain bugs which can cause them to exceed their allocated memory. If a program fails, it may cause memory used by one or more other programs to be affected or overwritten. Malicious programs or viruses may purposefully alter another program's memory, or may affect the operation of the operating system itself. With cooperative memory management, it takes only one misbehaved program to crash the system. Memory protection enables the kernel to limit a process' access to the computer's memory. Various methods of memory protection exist, including memory segmentation and paging. All methods require some level of hardware support (such as the 80286 MMU), which doesn't exist in all computers.
    [Show full text]
  • Measuring Software Performance on Linux Technical Report
    Measuring Software Performance on Linux Technical Report November 21, 2018 Martin Becker Samarjit Chakraborty Chair of Real-Time Computer Systems Chair of Real-Time Computer Systems Technical University of Munich Technical University of Munich Munich, Germany Munich, Germany [email protected] [email protected] OS program program CPU .text .bss + + .data +/- + instructions cache branch + coherency scheduler misprediction core + pollution + migrations data + + interrupt L1i$ miss access + + + + + + context mode + + (TLB flush) TLB + switch data switch miss L1d$ +/- + (KPTI TLB flush) miss prefetch +/- + + + higher-level readahead + page cache miss walk + + multicore + + (TLB shootdown) TLB coherency page DRAM + page fault + cache miss + + + disk + major minor I/O Figure 1. Event interaction map for a program running on an Intel Core processor on Linux. Each event itself may cause processor cycles, and inhibit (−), enable (+), or modulate (⊗) others. Abstract that our measurement setup has a large impact on the results. Measuring and analyzing the performance of software has More surprisingly, however, they also suggest that the setup reached a high complexity, caused by more advanced pro- can be negligible for certain analysis methods. Furthermore, cessor designs and the intricate interaction between user we found that our setup maintains significantly better per- formance under background load conditions, which means arXiv:1811.01412v2 [cs.PF] 20 Nov 2018 programs, the operating system, and the processor’s microar- chitecture. In this report, we summarize our experience on it can be used to improve high-performance applications. how performance characteristics of software should be mea- CCS Concepts • Software and its engineering → Soft- sured when running on a Linux operating system and a ware performance; modern processor.
    [Show full text]
  • Guide to Openvms Performance Management
    Guide to OpenVMS Performance Management Order Number: AA–PV5XA–TE May 1993 This manual is a conceptual and tutorial guide for experienced users responsible for optimizing performance on OpenVMS systems. Revision/Update Information: This manual supersedes the Guide to VMS Performance Management, Version 5.2. Software Version: OpenVMS VAX Version 6.0 Digital Equipment Corporation Maynard, Massachusetts May 1993 Digital Equipment Corporation makes no representations that the use of its products in the manner described in this publication will not infringe on existing or future patent rights, nor do the descriptions contained in this publication imply the granting of licenses to make, use, or sell equipment or software in accordance with the description. Possession, use, or copying of the software described in this publication is authorized only pursuant to a valid written license from Digital or an authorized sublicensor. © Digital Equipment Corporation 1993. All rights reserved. The postpaid Reader’s Comments forms at the end of this document request your critical evaluation to assist in preparing future documentation. The following are trademarks of Digital Equipment Corporation: ACMS, ALL–IN–1, Bookreader, CI, DBMS, DECnet, DECwindows, Digital, MicroVAX, OpenVMS, PDP–11, VAX, VAXcluster, VAX DOCUMENT, VMS, and the DIGITAL logo. All other trademarks and registered trademarks are the property of their respective holders. ZK4521 This document was prepared using VAX DOCUMENT Version 2.1. Contents Preface ............................................................ ix 1 Introduction to Performance Management 1.1 Knowing Your Workload ....................................... 1–2 1.1.1 Workload Management .................................... 1–3 1.1.2 Workload Distribution ..................................... 1–4 1.1.3 Code Sharing ............................................ 1–4 1.2 Evaluating User Complaints .
    [Show full text]
  • Virtual Memory §5.4 Virt Virtual Memory U Al Memo Use Main Memory As a “Cache” For
    Chapter 5 Large and Fast: Exppgloiting Memory Hierarchy Part II Virtual Memory §5.4 Virt Virtual Memory u al Memo Use main memory as a “cache” for secondary (disk) storage r y Managed jointly by CPU hardware and the operating system (OS) Programs share main memory Each gets a private virtual address space holdinggqy its frequently used code and data Protected from other programs CPU and OS translate virtual addresses to physical addresses VM “block” is called a page VM translation “miss” is called a page fault Chapter 5 — Large and Fast: Exploiting Memory Hierarchy — 2 Address Translation Fixed-size pages (e.g., 4K) Chapter 5 — Large and Fast: Exploiting Memory Hierarchy — 3 Page Fault Penalty On page fault, the page must be fetched from disk Takes millions of clock cycles Handled by OS code Try to minimize page fault rate Fully associative placement Smart replacement algorithms Chapter 5 — Large and Fast: Exploiting Memory Hierarchy — 4 Page Tables Stores placement information Array of page table entries, indexed by virtual page number Page table register in CPU points to page table in physical memory If page is present in memory PTE stores the physical page number Plus other status bits (referenced, dirty, …) If page is not present PTE can refer to location in swap space on dis k Chapter 5 — Large and Fast: Exploiting Memory Hierarchy — 5 Translation Using a Page Table Chapter 5 — Large and Fast: Exploiting Memory Hierarchy — 6 Mapping Pages to Storage Chapter 5 — Large and Fast: Exploiting Memory Hierarchy — 7 Replacement and Writes
    [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/ Virtual Memory and Paging UC Santa Barbara • What if a program is too big to be loaded in memory • What if a higher degree of multiprogramming is desirable • Physical memory is split in page frames • Virtual memory is split in pages • OS (with help from the hardware) manages the mapping between pages and page frames 2 Mapping Pages to Page Frames UC Santa Barbara • Virtual memory: 64KB • Physical memory: 32KB • Page size: 4KB • Virtual memory pages: 16 • Physical memory pages: 8 3 Memory Management Unit UC Santa Barbara • Automatically performs the mapping from virtual addresses into physical addresses 4 Memory Management Unit UC Santa Barbara • Addresses are split into a page number and an offset • Page numbers are used to look up a table in the MMU with as many entries as the number of virtual pages • Each entry in the table contains a bit that states if the virtual page is actually mapped to a physical one • If it is so, the entry contains the number of physical page used • If not, a page fault is generated and the OS has to deal with it 5 Page Tables UC Santa Barbara • Page tables contain an entry for each virtual table • If virtual memory is big (e.g., 32 bit and 64 bit addresses) the table can become of unmanageable size • Solution: instead of keeping them in the MMU move them to main memory • Problem: page tables are used each time an access to memory is performed.
    [Show full text]
  • An Evolutionary Study of Linux Memory Management for Fun and Profit Jian Huang, Moinuddin K
    An Evolutionary Study of Linux Memory Management for Fun and Profit Jian Huang, Moinuddin K. Qureshi, and Karsten Schwan, Georgia Institute of Technology https://www.usenix.org/conference/atc16/technical-sessions/presentation/huang This paper is included in the Proceedings of the 2016 USENIX Annual Technical Conference (USENIX ATC ’16). June 22–24, 2016 • Denver, CO, USA 978-1-931971-30-0 Open access to the Proceedings of the 2016 USENIX Annual Technical Conference (USENIX ATC ’16) is sponsored by USENIX. An Evolutionary Study of inu emory anagement for Fun and rofit Jian Huang, Moinuddin K. ureshi, Karsten Schwan Georgia Institute of Technology Astract the patches committed over the last five years from 2009 to 2015. The study covers 4587 patches across Linux We present a comprehensive and uantitative study on versions from 2.6.32.1 to 4.0-rc4. We manually label the development of the Linux memory manager. The each patch after carefully checking the patch, its descrip- study examines 4587 committed patches over the last tions, and follow-up discussions posted by developers. five years (2009-2015) since Linux version 2.6.32. In- To further understand patch distribution over memory se- sights derived from this study concern the development mantics, we build a tool called MChecker to identify the process of the virtual memory system, including its patch changes to the key functions in mm. MChecker matches distribution and patterns, and techniues for memory op- the patches with the source code to track the hot func- timizations and semantics. Specifically, we find that tions that have been updated intensively.
    [Show full text]
  • CS423 Spring 2014 MP3: Virtual Memory Page Fault Profiler Due: April 7Th, 11:00 Am
    CS423 Spring 2014 MP3: Virtual Memory Page Fault Profiler Due: April 7th, 11:00 am 1. Goals and Overview • Understand the Linux virtual to physical page mapping and page fault rate. • Design a lightweight tool that can profile page fault rate. • Implement the profiler tool as a Linux kernel module. • Learn how to use the kernel-level APIs for character devices, vmalloc(), and mmap(). • Test the kernel-level profiler by using a given user-level benchmark program. • Analyze, plot, and document the profiled data as a function of the workload characteristics. 2. Development Setup The development setup is the same as MP2. After MP1 and MP2, you should be familiar with the Linux kernel programming environment provided by the department virtual machines. You will work on the provided Virtual Machine and you will develop kernel modules for the Linux Kernel 3.5.0 provided in this Virtual Machine. Please reboot your Virtual Machine before starting MP3. Also, it is recommended that you backup your work often by making copies to external media or by using the check-pointing feature of your Virtual Machine (by executing “Take Snapshot” in the right-click menu of your VM). It is very easy to damage your Virtual Machine doing kernel programming and you risk losing all your work. 3. Introduction Due to the ever growing performance gap between memory and hard disk, the management efficiency of the operating system virtual memory system becomes more important to the whole system performance. For example, an inefficient replacement of memory pages can seriously harm the response time and the throughput of user-level programs.
    [Show full text]
  • Virtual Memory March 18, 2008
    OOppeerraatitinngg SSyysstetemmss CCMMPPSSCC 447733 Virtual Memory March 18, 2008 - Lecture 16 Instructor: Trent Jaeger • Last class: – Paging • Today: – Virtual Memory Virtual Memory • What if programs require more memory than available physical memory? – Use overlays • Difficult to program though! – Virtual Memory. • Supports programs that are larger than available physical memory. • Allows several programs to reside in physical memory (or at-least the relevant portions of them). • Allows non-contiguous allocation without making programming difficult. Example Virtual Address Space-1 (1 MB) Virtual Address Physical Space-2 (1 MB) Memory . (16 KB) . Virtual Address Space-n (1 MB) Page Faults • If a Page-table mapping indicates an absence of the page in physical memory, hardware raises a “Page- Fault”. • OS traps this fault and the interrupt handler services the fault by initiating a disk-read request. • Once page is brought in from disk to main memory, page-table entry is updated and the process which faulted is restarted. – May involve replacing another page and invalidating the corresponding page-table entry. Page Table When Some Pages Are Not in Main Memory Page Fault • If there is a reference to a page, first reference to that page will trap to operating system: – page fault • Operating system looks at another table to decide: – Invalid reference -- abort – Just not in memory • Get empty frame • Swap page into frame • Reset tables • Set validation bit = v • Restart the instruction that caused the page fault Steps in Handling a Page
    [Show full text]
  • User Level Page Faults
    August 12, 2020 DRAFT User Level Page Faults Qingyang Li CMU-CS-20-124 August School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Seth Goldstein, Chair Someone else Submitted in partial fulfillment of the requirements for the degree of Masters in Computer Science. Copyright c 2020 Qingyang Li August 12, 2020 DRAFT Keywords: User level interrupt, TLB, page table, MMU, page fault August 12, 2020 DRAFT For my grandparents: I am resting in the shade of trees that you planted. August 12, 2020 DRAFT iv August 12, 2020 DRAFT Abstract Memory management has always been a responsibility shared by the hardware and the operating system. The MMU (memory management unit) walks the kernel- managed page tables to ensure safety and isolation between process’ data. While users can alter some aspects of the memory system they control (e.g., permissions) these operations come with a high overhead. We propose User Level Page Tables as a hardware/software mechanism that of- fers a low overhead mechanism for users to manage their application memory per- missions while still having hardware enforcing those permissions. Our mechanism allows users to modify page permissions with a single write in user space and with- out changing privilege levels. Users can also handle many types of page faults using handler functions that they install, without crossing into kernel space. To realize this mechanism, we modify the hardware address translation pipeline, specifically the MMU and TLB components. We also modify the Linux kernel by adding a set of “shadow” user-level page tables. We evaluate our approach of User Level Page Tables by looking at the overhead of watchpoints.
    [Show full text]
  • Basic Algorithms
    Basic Algorithms • Use “use” and “modify” bits 1. Scan for first frame with u=0, m=0 2. If 1) fails look for frame with u=0, m=1, setting the use bits to 0 during scan 3. If 2) failed repeating 1) and 2) will find a replacement 1 2 Resident Set Size • Fixed-allocation – Gives a process a fixed number of pages within which to execute – When a page fault occurs, one of the pages of that process must be replaced • Variable-allocation – Number of pages allocated to a process varies over the lifetime of the process 3 Fixed Allocation, Local Scope • Decide ahead of time the amount of allocation to give a process – If allocation is too small, there will be a high page fault rate – If allocation is too large there will be too few programs in main memory 4 Variable Allocation, Global Scope • Easiest to implement • Adopted by many operating systems • Operating system keeps list of free frames • Free frame is added to resident set of process when a page fault occurs • If no free frame, replaces one from another process 5 Variable Allocation, Local Scope • When new process added, allocate number of page frames based on application type, program request, or other criteria • When page fault occurs, select page from among the resident set of the process that suffers the fault • Reevaluate allocation from time to time 6 Cleaning Policy • Demand cleaning – A page is written out only when it has been selected for replacement • Precleaning – Pages are written out in batches 7 Cleaning Policy • Best approach uses page buffering – Replaced pages are placed
    [Show full text]