PPT-Paging

Virtual Memory Segmentation Basic early approach Paging Modern approach Advantages Easy to allocate physical memory Easy to page outswap chunks of memory Disadvantages Overhead added to each memory reference. Memory Pages InputSec 10 Reads from hard disk per second to resolve hard pages Memory PagesSec See Description Often referenced in older documentation Useful only in combination with Pages InputSec Usage Usage Peak Paging File Usage 70 Amount of P We have seen how CPU can be shared by a set of processes. Improve system performance . Process management. Need to keep several process in memory. Share memory. Learn various techniques to manage memory. – Thrashing, Segmentation and Paging CS 416: Operating Systems Design, Spring 2011 Department of Computer Science Rutgers University Rutgers Sakai: 01:198:416 Sp11 (https://sakai.rutgers.edu) 1. 9. Linking and Sharing. 9.1 Single-Copy Sharing . Why Share . Requirements for Sharing. Linking and Sharing . 9.2 Sharing in Systems without Virtual Memory. 9.3 Sharing in Paging Systems. Sharing of Data. -Bhavtosh . Rath. Multi – user system: Log files needed for concurrency control.. Single – user system: An alternative !. Shadow Paging.. Rollback/Abort - Database is returned . to its state prior to the transaction that was executing when the . Mark . Russinovich. Technical Fellow. Windows Azure. (created jointly with Dave Solomon). WCL406. Goals. Deep dive on:. Process virtual and physical memory usage. Operating system virtual and physical memory usage. Instructor: Junfeng Yang Outline  Memory management goals  Segmentation  Paging  TLB 1 Multiprogramming  Simple uniprogramming with a single segment per proce Exceeding the Best of Nested and Shadow Paging. Jayneel Gandhi. , Mark D. Hill, Michael M. Swift. Executive Summary. Problem:. Virtualization valuable but have high overheads with larger workloads. (at most 70% slower than native). Alejandro . López. -Ortiz , . Alejandro Salinger. University . of Waterloo. Outline. Paging . Paging . with cache usage. Interval Scheduling. Online algorithms. Simulations. Conclusions. 2. Paging. 3. Mark . Russinovich. Technical Fellow. Windows Azure. (created jointly with Dave Solomon). WCL406. Goals. Deep dive on:. Process virtual and physical memory usage. Operating system virtual and physical memory usage. Lecture . 29. Memory. (6). Review. P2 . assigned. Exam 2 next . Friday. Demand paging. Page faults. TLB intro. Advantage of TLB. When does TLB offer an advantage. When most of the page numbers the process refers to is in the TLB. . WHY WIRELESS COMMUNICATION?. Freedom from wires.. No bunch of wires running from here and there.. “Auto Magical” instantaneous communication without physical connection setup e.g.- Bluetooth, Wi-Fi.. Chapter 7. 2. Roadmap. M. emory management . Objectives. . Requirements. Simple memory management. . Memory partitioning. . Fixed partitioning. . Dynamic partitioning. . Address translation. in progress. In emergency. , contact, Paul Bierman. 802 863 3609 (home) 802 238 6826 (cell phone) . 802.350.9630 (pager) . 9993100@paging.contactbeep.com (pager). pbierman@uvm.edu. (email).