CS533 Concepts of Operating Systems Class 14

Slides:



Advertisements
Similar presentations
Slide 19-1 Copyright © 2004 Pearson Education, Inc. Operating Systems: A Modern Perspective, Chapter 19.
Advertisements

Operating Systems Lecture 10 Issues in Paging and Virtual Memory Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard. Zhiqing.
G Robert Grimm New York University Virtual Memory.
MACHINE-INDEPENDENT VIRTUAL MEMORY MANAGEMENT FOR PAGED UNIPROCESSOR AND MULTIPROCESSOR ARCHITECTURES R. Rashid, A. Tevanian, M. Young, D. Golub, R. Baron,
EECS 470 Virtual Memory Lecture 15. Why Use Virtual Memory? Decouples size of physical memory from programmer visible virtual memory Provides a convenient.
Virtual Memory. The Limits of Physical Addressing CPU Memory A0-A31 D0-D31 “Physical addresses” of memory locations Data All programs share one address.
Computer Organization CS224 Fall 2012 Lesson 44. Virtual Memory  Use main memory as a “cache” for secondary (disk) storage l Managed jointly by CPU hardware.
CS533 Concepts of Operating Systems Class 5 Integrated Task and Stack Management.
CS533 Concepts of Operating Systems Class 3 Monitors.
By: Richard Rashid, Avadis Tevanian, Michael Young, David Golub, Robert Baronn, David Black, William Bolosky, and Jonathan Chew, October 1987 Presented.
CS533 Concepts of Operating Systems Class 16 Exokernel.
CS533 Concepts of Operating Systems Class 6 The Duality of Threads and Events.
Translation Buffers (TLB’s)
CS533 Concepts of Operating Systems Class 7 Integrated Task and Stack Management.
CS533 Concepts of Operating Systems Class 3 Integrated Task and Stack Management.
03/22/2004CSCI 315 Operating Systems Design1 Virtual Memory Notice: The slides for this lecture have been largely based on those accompanying the textbook.
Mem. Hier. CSE 471 Aut 011 Evolution in Memory Management Techniques In early days, single program run on the whole machine –Used all the memory available.
CS533 Concepts of Operating Systems Class 14 Extensible Virtual Memory Management.
Vir. Mem II CSE 471 Aut 011 Synonyms v.p. x, process A v.p. y, process B v.p # index Map to same physical page Map to synonyms in the cache To avoid synonyms,
Basics of Operating Systems March 4, 2001 Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard.
Mac OS X Panther Operating System
Review of Memory Management, Virtual Memory CS448.
Lecture 19: Virtual Memory
CS533 Concepts of Operating Systems Jonathan Walpole.
8.1 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Paging Physical address space of a process can be noncontiguous Avoids.
CS399 New Beginnings Jonathan Walpole. Virtual Memory (1)
A summary by Nick Rayner for PSU CS533, Spring 2006
M. Accetta, R. Baron, W. Bolosky, D. Golub, R. Rashid, A. Tevanian, and M. Young MACH: A New Kernel Foundation for UNIX Development Presenter: Wei-Lwun.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Demand Paging.
CS2100 Computer Organisation Virtual Memory – Own reading only (AY2015/6) Semester 1.
CS 390 Unix Programming Environment
Virtual Memory Ch. 8 & 9 Silberschatz Operating Systems Book.
CS 3204 Operating Systems Godmar Back Lecture 16.
Page Replacement Implementation Issues Text: –Tanenbaum ch. 4.7.
CMSC 611: Advanced Computer Architecture
Virtual Memory So, how is this possible?
Vivek Seshadri 15740/18740 Computer Architecture
Virtual Memory Chapter 7.4.
Memory COMPUTER ARCHITECTURE
Memory Management Paging (continued) Segmentation
Memory Caches & TLB Virtual Memory
From Address Translation to Demand Paging
Some Real Problem What if a program needs more memory than the machine has? even if individual programs fit in memory, how can we run multiple programs?
Memory Hierarchy Virtual Memory, Address Translation
Morgan Kaufmann Publishers
CS510 Operating System Foundations
CSE 153 Design of Operating Systems Winter 2018
CSCI206 - Computer Organization & Programming
Evolution in Memory Management Techniques
Page Replacement.
Memory Management Paging (continued) Segmentation
Translation Buffers (TLB’s)
Virtual Memory Overcoming main memory size limitation
Chapter 2: Operating-System Structures
Introduction to Operating Systems
CSE 451: Operating Systems Autumn 2003 Lecture 10 Paging & TLBs
Translation Buffers (TLB’s)
CSE 451: Operating Systems Autumn 2003 Lecture 10 Paging & TLBs
Computer Architecture
CSE 471 Autumn 1998 Virtual memory
CSE 153 Design of Operating Systems Winter 2019
Translation Buffers (TLBs)
Chapter 2: Operating-System Structures
CS533 Concepts of Operating Systems Class 15
Memory Management Paging (continued) Segmentation
OPERATING SYSTEMS MEMORY MANAGEMENT BY DR.V.R.ELANGOVAN.
Synonyms v.p. x, process A v.p # index Map to same physical page
Introduction to Computer Systems Engineering
Review What are the advantages/disadvantages of pages versus segments?
Paging Andrew Whitaker CSE451.
Presentation transcript:

CS533 Concepts of Operating Systems Class 14 Extensible Virtual Memory Management

CS533 - Concepts of Operating Systems Questions What is an inverted page table? Why are they good for large sparse address spaces? How are address maps, memory allocation queues, memory object lists, memory objects, resident page tables, and pmap used to Handle a page fault? Page out a page? Allocate memory Deallocate memory CS533 - Concepts of Operating Systems

CS533 - Concepts of Operating Systems Questions Why does Mach distinguish between current and maximum protection for pages? Why are shadow objects and sharing maps needed? How would task A share a page copy-on-write with task B and read-write with task C? Why might you end up with long chains of shadow objects? Why is this a problem? How could you optimize them? CS533 - Concepts of Operating Systems

CS533 - Concepts of Operating Systems Questions How can Mach support lazy modification of pmap? Why don’t inverted page tables support aliasing well? What three strategies can Mach use to maintain TLB consistency on multiprocessors that do not support inter-CPU TLB flush operations? Which one reminds you of RCU and why? CS533 - Concepts of Operating Systems

CS533 - Concepts of Operating Systems Questions Why push virtual memory fault handling to user level? What kind of user-level instructions can it replace? Is it always more efficient to use VM faults than user-level interpretation? What are the performance trade-offs? Can VM fault handling be used to implement synchronization? i.e., instead of locks? If so, how? CS533 - Concepts of Operating Systems

CS533 - Concepts of Operating Systems Questions Why are these technique more difficult to use on modern CPUs with deep pipelines, out of order instructions and weak memory consistency? Why do hardware details such as physically vs virtually indexed caches affect aliasing costs? Why do OS details such as inverted page tables affect aliasing costs? CS533 - Concepts of Operating Systems

CS533 - Concepts of Operating Systems Reminder Complete class evaluation form Send me a draft of your slides early CS533 - Concepts of Operating Systems

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.