PPT-Main Memory: Paging and Segmentation

CSSE 332 Operating Systems RoseHulman Institute of Technology Segmentation Memorymanagement scheme that supports user view of memory A program is a collection of segments A segment is a logical unit such as. g a core dump Semiconductors are almost universal today Memory Cells Properties Exhibit two stable or semi stable states representing 1 and 0 Capable of being written to at least once to set state Capable of being read to sense the state Memory Cell 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 Instructor: Junfeng Yang Outline  Memory management goals  Segmentation  Paging  TLB 1 Uni - v.s. multi - programming  Simple uniprogramming with a single segm – 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) Instructor: Junfeng Yang Outline  Memory management goals  Segmentation  Paging  TLB 1 Multiprogramming  Simple uniprogramming with a single segment per proce By . Carl A. . Waldspurger. Presented by Clyde Byrd III. (some slides adapted . from C. . Waldspurger. ). EECS 582 – W16. 1. Overview. Background. Memory . Reclamation. Page Sharing. Memory Allocation . 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. . Chapter 7. 2. Roadmap. M. emory management . Objectives. . Requirements. Simple memory management. . Memory partitioning. . Fixed partitioning. . Dynamic partitioning. . Address translation. BYU CS 345. Memory Management. 2. CS 345. Stalling’s Chapter. #. Project. 1: Computer System Overview. 2: Operating System Overview. 4. P1:. Shell. 3: Process Description and Control. 4: Threads. 4. Seventh Edition. Chapter 3. Memory Management:. Virtual Memory Systems. Understanding Operating Systems, 7e. Learning Objectives. After completing this chapter, you should be able to describe:. The basic functionality of the memory allocation methods covered in this chapter. Background. Swapping . Contiguous Memory Allocation. Segmentation. Paging. Structure of the Page Table. Example: The Intel 32 and 64-bit Architectures. Example: ARM Architecture. Objectives. To provide a detailed description of various ways of organizing memory hardware. Von Neumann architecture:. Program and data is in the same memory (code . is. data). Harvard architecture:. Physically separate memory for code and data. Program must be brought (from disk) into memory and placed within a process for it to be run. with Application-Transparent Support . for Multiple Page Sizes. Rachata. . Ausavarungniru. n. ,. . Joshua Landgraf, Vance Miller. Saugata. . Ghose. , . Jayneel. Gandhi, Christopher J. . Rossbach. Background. Contiguous Memory Allocation. Paging. Structure of the Page Table. Swapping. Example: The Intel 32 and 64-bit Architectures. Example: ARMv8 Architecture. Objectives. To provide a detailed description of various ways of organizing memory hardware.