Main Memory. CISC3595, Spring 2015 X. Zhang Fordham University
|
|
- Candice Alexander
- 6 years ago
- Views:
Transcription
1 Main Memory CISC3595, Spring 2015 X. Zhang Fordham University 1
2 Memory Management! Background!! Contiguous Memory Allocation!! Paging!! Structure of the Page Table!! Segmentation!! Example: The Intel Pentium 2
3 Background! Main memory and registers are the only storages that CPU can access directly!! Register access: one CPU clock (or less)!! Main memory access: many CPU cycles!! Cache sits between main memory and CPU registers!! Memory is cheap today, and getting cheaper!! But applications are demanding more and more memory, there is never enough! 3
4 Review: Logic View of a Computer 4 Main memory:! a large array of words or bytes. Each words has its own address.
5 The need for memory management! Memory Management, involves swapping blocks of data from secondary storage!! Bring processes into main memory for execution by processor!! Protection of memory required to ensure correct operation!! Memory needs to be allocated to ensure a reasonable supply of ready processes to consume available processor time 8
6 Memory Management Requirements! Relocation!! Programmer does not know where program will be placed in memory!! it may be swapped to disk and return to main memory at a different location (relocated)!! Memory references in the program must be translated to actual physical memory address!! Protection!! Sharing!! Logical organization!! Physical organization 9
7 Requirements: Protection! Processes should not be able to reference memory locations in another process without permission!! Unless special arrangement is made, e.g., shared memory segment is setup!! Memory protection checking!! performed at run time!! Impossible to check absolute addresses to ensure protection at compile time!! Program might calculate address at run time, e.g., access array element, pointer to a data structure!! By processor (hardware)!! OS cannot anticipate all memory reference of a program!! Too time consuming if done by software 22
8 Requirements: Sharing! Allow several cooperating processes to access same portion of memory!! ex: system call shmget: to allocate shared memory segment!! Allow shared library!! Allow multiple processes running same program to access same copy of the program rather than have their own separate copy 24
9 Multistep Processing of a User Program Programmer s view of a program/process?! 11
10 Multistep Processing of a User Program Compiler seldom knows where an! object will reside, it assumes a! fixed base location (for example, zero).! 12
11 Multistep Processing of a User Program Linker/Linkage editor! * combines multiple object! files into a executable program,! resolving symbols as it goes along.! arranges objects in a program's! address space. Relocating code! that assumes a specific base address! to another base 13
12 Dynamic Linking! Linking postponed until execution time!! Small piece of code, stub, used to locate appropriate memory-resident library routine!! Stub replaces itself with the address of the routine, and executes routine!! Operating system needed to check if routine is in other processes memory address!! Dynamic linking is particularly useful for libraries!! also known as shared libraries 14
13 Demo! To view shared library requires by a program!! ldd /usr/bin/ls!! ldd lab4.out!! libpthread.so.0!! Flag -static will force linker to use static library (.a) instead of shared (.so)!! But static libraries not always installed by default. So if you need static link you have to install static libraries.!! Lab5: libproc (a library to be shared by all students).! 17
14 Multistep Processing of a User Program Loader start up programs:! read executable files into memory,! carry out other required preparatory! tasks so that the process can run!! Unix loader, i.e., handler for execve() :! * validation (permissions, memory! requirements etc.);! Copy program image from disk into memor! Copy command-line arguments on stack! Initialize registers (e.g., stack pointer)! Jump to program entry point (_start)!!! 15
15 Dynamic Loading Mechanism! Allow a program to load, execute and unload library (or binary code) at run time!! loads a library (or other binary) into memory!! retrieves addresses of functions and variables contained in the library!! executes those functions or access those variables!! unloads library from memory.!! Benefits: better memory-space utilization: unused routine is never loaded!! Useful when large amounts of code are needed to handle infrequently occurring cases 16
16 Dynamic Loading (cont d)!!!! void *lib_handle; double (*fn)(int *); int x; char *error; lib_handle = dlopen("./libctest.so.1.0", RTLD_LAZY); if (!lib_handle) { fprintf(stderr, "%s\n", dlerror()); exit(1); } fn = dlsym(lib_handle, "ctest1"); if ((error = dlerror())!= NULL) { fprintf(stderr, "%s\n", error); exit(1); } (*fn)(&x); printf("valx=%d\n",x); dlclose(lib_handle); 17
17 Logical vs. Physical Address Space! Logical address generated by CPU; also referred to as virtual address!! User program deals with logical addresses; it never sees the real physical addresses!! Physical address address seen by memory unit!! Memory-management Unit (MMU): hardware for run time mapping from logical address space to a physical address space!! Many different schemes for the mapping!! First let s see an simple example 20
18 Address protection: base and limit registers 23
19 Requirements: Logical Organization! Programs are written in modules!! Modules can be written and compiled independently!! Different degrees of protection given to modules: read-only, readable/writable!! Share modules among processes!! OS and hardware provide support for deal with such requirement through segmentation 25
20 Requirements: Physical Organization! Keep track of available memory blocks, allocate and reclaim them as processes come and go!! Cannot leave programmer with the responsibility to manage memory!! Memory available for a program plus its data may be insufficient!! Overlaying: program and data are organized in such a way that various modules can be assigned same region of memory, main program responsible for switching modules in and out => costly for programmer!! Programmer does not know how much space will be available, and where 26
21 Roadmap: Memory Allocation Schemes! Contiguous Allocation!! Paging!! Segmentation 27
22 No Memory Abstraction Figure 3-1. Three simple ways of organizing memory with an operating system and one user process. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
23 Multiple Programs Without Memory Abstraction Figure 3-2. Illustration of the relocation problem. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
24 Base and Limit Registers Figure 3-3. Base and limit registers can be used to give each process a separate address space. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
25 Swapping (1) Figure 3-4. Memory allocation changes as processes come into memory and leave it. The shaded regions are unused memory. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
26 Swapping (2) Figure 3-5. (a) Allocating space for growing data segment. (b) Allocating space for growing stack, growing data segment. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
27 Memory Management with Bitmaps Figure 3-6. (a) A part of memory with five processes and three holes. The tick marks show the memory allocation units. The shaded regions (0 in the bitmap) are free. (b) The corresponding bitmap. (c) The same information as a list. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
28 Memory Management with Linked Lists Figure 3-7. Four neighbor combinations for the terminating process, X. Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved
29 Contiguous Allocation! Main memory usually divided into two partitions:!! Resident operating system, usually held in low memory with interrupt vector!! User processes held in high memory!! Relocation registers used to protect user processes from each other, and from changing operating-system code and data!! Base register contains value of smallest physical address!! Limit register contains range of logical addresses each logical address must be less than the limit register!! MMU maps logical address dynamically 28
30 Contiguous Allocation (Cont.)! Multiple-partition allocation!! Hole block of available memory; holes of various size are scattered throughout memory!! When a process arrives, it is allocated memory from a hole large enough to accommodate it!! Operating system maintains information about: a) allocated partitions b) free partitions (hole) OS OS OS OS process 5 process 5 process 5 process 5 process 9 process 9 process 8 process 10 process 2 process 2 process 2 process 2 29
31 Dynamic Storage-Allocation Problem How to satisfy a request of size n from a list of free holes! First-fit: Allocate the first hole that is big enough!! Best-fit: Allocate the smallest hole that is big enough; must search entire list, unless ordered by size!! Produces the smallest leftover hole!! Worst-fit: Allocate the largest hole; must also search entire list!! Produces the largest leftover hole 30 First-fit and best-fit better than worst-fit in terms of speed and storage utilization
32 Fragmentation problem! External Fragmentation total memory space exists to satisfy a request, but it is not contiguous!! Internal Fragmentation allocated memory may be slightly larger than requested memory; this size difference is memory internal to a partition, but not being used!! Reduce external fragmentation by compaction!! Shuffle memory contents to place all free memory together in one large block!! Possible only if relocation (final binding to memory address) is done at execution time!! To solve external fragmentation problem!! Allocate noncontiguous memory to process!! Paging, Segmentation, and Combined 31
33 Roadmap: Memory Allocation Schemes! Contiguous Allocation!! Paging!! Segmentation 27
34 Paging! Physical address space of a process can be noncontiguous!! process is allocated physical memory wherever it is available!! Logical address space of a process is still contiguous!! Physical memory divided into fixed-sized blocks called frames!! Frame size is power of 2, between 512 bytes and 8,192 bytes!! Logical memory divided into blocks of same size called pages!! System keeps track of all free frames!! To run a program of size n pages, need to find n free frames!! Set up a page table for logical => physical addresses translation!! Paging scheme address external fragmentation!! internal fragmentation is still possible 32
35 Paging Model of Logical and Physical Memory A process s page table: for logical => physical addresses translation! * contains base address of each page in physical memory 33
36 Logic address under Paging scheme! Logical address (address generated by CPU) is divided into:!! Page number (p) an index into a page table which contains base address of each page in physical memory!! Page offset (d) relative address (within page), combined with base address to define physical memory address that is sent to the memory unit! page number page offset! p d! m - n n!!! For given logical address space 2 m and page size 2 n 34
37 MMU: Paging 35
38 Paging Example byte memory and 4-byte pages
39 Free Frames 37 Before allocation After allocation
40 Implementation of Page Table! Where to store the page tables?!! Register? too small!! Page table is kept in main memory!! Page-table base register (PTBR) points to the page table!! Page-table length register (PRLR) indicates size of the page table!! Every data/instruction access requires two memory accesses!! One for page table and one for the actual data/instruction.!! To avoid two memory access problem. 38
41 Associative Memory! a special fast-lookup hardware cache called associative memory or translation look-aside buffers (TLBs)!! Some TLBs store address-space identifiers (ASIDs) in each entry uniquely identifies each process to provide address-space protection!! Associative memory parallel search for all entries!!!!! Page # Frame #! Address translation (p, d)!! If p is in associative register, get frame # out!! Otherwise get frame # from page table in memory 39
42 Paging Hardware With TLB 40
43 Effective Access Time! Associative Lookup = ε time unit (e.g. 20 ns)!! Hit ratio percentage of times that a page number is found in the associative registers; ratio related to number of associative registers!! Hit ratio = α (e.g. 80%)!! Time to access memory (e.g. 100 ns)!! Effective Access Time (EAT)! e.g. EAT = 0.80 x x ( )! (found in TLB) =140 ns (not found in TLB)! 41
44 Memory Protection! Memory protection implemented by associating protection bit with each frame! Valid-invalid bit attached to each entry in the page table:!! valid indicates that the associated page is in the process logical address space, and is thus a legal page!! invalid indicates that the page is not in the process logical address space 42
45 Valid (v) or Invalid (i) Bit In A Page Table Most processes do not use whole logic address space Address space: 2 14 (0,, 16383),! Process use only 0 to 10468! Page size: 2KB Alternative: page-table length register (PTLR) 43
46 Shared Pages! Useful for shared code (reentrant code, pure code)!! One copy of read-only code shared among processes (i.e., text editors, compilers, window systems).!! Each process has its own copy of registers and data storage to hold its data!! Shared code page and private data page 44
47 Shared Pages Example 45
48 Structure of the Page Table! To support large logic address space!! up to 2 32 or 2 64!! page table too large to put in a contiguous memory!! Solutions!!!! Hierarchical Paging!! Hashed Page Tables!! Inverted Page Tables 46
49 Hierarchical Page Tables! Break up the logical address space into multiple page tables!!! A simple technique is a two-level page table!! e.g. for large logical address spaces 2 32 to
50 Two-Level Page-Table Scheme 48
51 Two-Level Paging Example! A logical address (on 32-bit machine with 1K page size) is divided into:!! a page number consisting of 22 bits!! a page offset consisting of 10 bits!! Since the page table is paged, the page number is further divided into:!! a 12-bit page number!! a 10-bit page offset!! Thus, a logical address is as follows: page number page offset p i p 2 d where p i is an index into the outer page table, and p 2 is the displacement within the page of the outer page table
52 Address-Translation Scheme 50
53 Three-level Paging Scheme 51
54 Hashed Page Tables! Common in address spaces > 32 bits!!! Virtual page number is hashed into a page table. This page table contains a chain of elements hashing to the same location.!!! Virtual page numbers are compared in this chain searching for a match. If a match is found, the corresponding physical frame is extracted. 52
55 Hashed Page Table 53
56 Inverted Page Table! One entry for each real page of memory!! Entry consists of virtual address of the page stored in that real memory location, with information about process that owns that page!! Decreases memory needed to store each page table, but increases time needed to search the table when a page reference occurs!! Use hash table to limit the search to one or at most a few page-table entries 54
57 Inverted Page Table Architecture 55
58 Segmentation! Memory-management scheme that supports user view of memory!! A program is a collection of segments. A segment is a logical unit such as:!!! main program,!!! procedure,!!! function,!!! method,!!! object,!!! local variables, global variables,!!! common block,!!! stack,!!! symbol table, arrays 56
59 Logical View of Segmentation user space physical memory space 57
60 Segmentation Architecture! A process s logical address consists of a two-tuple:!!! <segment-number, offset>,!! Segment table maps two-dimensional physical addresses; each table entry has:!! base contains starting physical address where the segments reside in memory!! limit specifies length of the segment!! Segment-table base register (STBR)!! points to segment table s location in memory!! Segment-table length register (STLR)!! indicates number of segments used by a program!! segment number s is legal if s < STLR 58
61 Segmentation Architecture (Cont.)! Protection!! With each entry in segment table associate:!! validation bit = 0 illegal segment!! read/write/execute privileges!! Protection bits associated with segments; code sharing occurs at segment level!! Since segments vary in length, memory allocation is a dynamic storage-allocation problem 59
62 Segmentation Hardware 60
63 Example of Segmentation 61
64 Example: The Intel Pentium! Supports both segmentation, and segmentation with paging!! CPU generates logical address!! Given to segmentation unit!! Which produces linear addresses!! Linear address given to paging unit!! Which generates physical address in main memory 62
65 Logical => Physical Address: in Pentium 63
66 Intel Pentium Segmentation 64
67 Pentium Paging Architecture 65
68 Linux on Pentium Systems Uses six segments:! 1. A segment for kernel code! 2. A segment for kernel data! 3. A segment for user code! 4. A segment for user data! 5. A task-state segment (TSS)! 6. A default local descriptor table (LDT) segment 66
69 Three-level Paging in Linux Linear Address in Linux 67
Chapter 8: Main Memory
Chapter 8: Main Memory Operating System Concepts 8 th Edition,! Silberschatz, Galvin and Gagne 2009! Chapter 8: Memory Management Background" Swapping " Contiguous Memory Allocation" Paging" Structure
More informationChapter 8: Main Memory
Chapter 8: Main Memory Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium 8.2 Silberschatz, Galvin
More information8.1 Background. Part Four - Memory Management. Chapter 8: Memory-Management Management Strategies. Chapter 8: Memory Management
Part Four - Memory Management 8.1 Background Chapter 8: Memory-Management Management Strategies Program must be brought into memory and placed within a process for it to be run Input queue collection of
More informationChapter 8: Memory Management Strategies
Chapter 8: Memory- Management Strategies, Silberschatz, Galvin and Gagne 2009 Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table
More informationChapter 9: Memory Management. Background
1 Chapter 9: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 9.1 Background Program must be brought into memory and placed within a process for
More informationChapter 7: Main Memory. Operating System Concepts Essentials 8 th Edition
Chapter 7: Main Memory Operating System Concepts Essentials 8 th Edition Silberschatz, Galvin and Gagne 2011 Chapter 7: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure
More informationI.-C. Lin, Assistant Professor. Textbook: Operating System Concepts 8ed CHAPTER 8: MEMORY
I.-C. Lin, Assistant Professor. Textbook: Operating System Concepts 8ed CHAPTER 8: MEMORY MANAGEMENT Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the
More informationChapter 8: Memory Management
Chapter 8: Memory Management Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 8.2 Background Program must be brought into memory and placed
More informationPart Three - Memory Management. Chapter 8: Memory-Management Strategies
Part Three - Memory Management Chapter 8: Memory-Management Strategies Chapter 8: Memory-Management Strategies 8.1 Background 8.2 Swapping 8.3 Contiguous Memory Allocation 8.4 Segmentation 8.5 Paging 8.6
More informationMemory Management. Memory Management
Memory Management Gordon College Stephen Brinton Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 1 Background Program must be brought into memory
More informationI.-C. Lin, Assistant Professor. Textbook: Operating System Principles 7ed CHAPTER 8: MEMORY
I.-C. Lin, Assistant Professor. Textbook: Operating System Principles 7ed CHAPTER 8: MEMORY MANAGEMENT Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of
More informationModule 9: Memory Management. Background. Binding of Instructions and Data to Memory
Module 9: Memory Management Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 9.1 Background Program must be brought into memory
More informationChapter 8: Memory- Manage g me m nt n S tra r t a e t gie i s
Chapter 8: Memory- Management Strategies Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium 2009/12/16
More informationCS307: Operating Systems
CS307: Operating Systems Chentao Wu 吴晨涛 Associate Professor Dept. of Computer Science and Engineering Shanghai Jiao Tong University SEIEE Building 3-513 wuct@cs.sjtu.edu.cn Download Lectures ftp://public.sjtu.edu.cn
More informationModule 8: Memory Management
Module 8: Memory Management Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging Operating System Concepts 8.1 Silberschatz and Galvin
More informationModule 8: Memory Management
Module 8: Memory Management Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 8.1 Background Program must be brought into memory
More informationChapter 8: Memory-Management Strategies
Chapter 8: Memory-Management Strategies Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel 32 and
More informationMemory Management. CSCI 315 Operating Systems Design Department of Computer Science
Memory Management CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture are based on those from Operating Systems Concepts, 9th ed., by Silberschatz, Galvin,
More informationCHAPTER 8: MEMORY MANAGEMENT. By I-Chen Lin Textbook: Operating System Concepts 9th Ed.
CHAPTER 8: MEMORY MANAGEMENT By I-Chen Lin Textbook: Operating System Concepts 9th Ed. Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the
More informationLogical versus Physical Address Space
CHAPTER 8: MEMORY MANAGEMENT Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging Operating System Concepts, Addison-Wesley 1994
More informationChapter 8: Memory- Management Strategies. Operating System Concepts 9 th Edition
Chapter 8: Memory- Management Strategies Operating System Concepts 9 th Edition Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation
More informationChapter 8: Memory- Management Strategies
Chapter 8: Memory Management Strategies Chapter 8: Memory- Management Strategies Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel 32 and
More informationChapter 8: Memory- Management Strategies. Operating System Concepts 9 th Edition
Chapter 8: Memory- Management Strategies Operating System Concepts 9 th Edition Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation
More informationGoals of Memory Management
Memory Management Goals of Memory Management Allocate available memory efficiently to multiple processes Main functions Allocate memory to processes when needed Keep track of what memory is used and what
More informationChapter 8: Main Memory. Operating System Concepts 9 th Edition
Chapter 8: Main Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel
More informationCHAPTER 8 - MEMORY MANAGEMENT STRATEGIES
CHAPTER 8 - MEMORY MANAGEMENT STRATEGIES OBJECTIVES Detailed description of various ways of organizing memory hardware Various memory-management techniques, including paging and segmentation To provide
More informationMemory Management. Memory
Memory Management These slides are created by Dr. Huang of George Mason University. Students registered in Dr. Huang s courses at GMU can make a single machine readable copy and print a single copy of
More informationMemory management. Last modified: Adaptation of Silberschatz, Galvin, Gagne slides for the textbook Applied Operating Systems Concepts
Memory management Last modified: 26.04.2016 1 Contents Background Logical and physical address spaces; address binding Overlaying, swapping Contiguous Memory Allocation Segmentation Paging Structure of
More informationChapter 8: Main Memory
Chapter 8: Main Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel
More informationMemory Management. Contents: Memory Management. How to generate code? Background
TDIU11 Operating systems Contents: Memory Management Memory Management [SGG7/8/9] Chapter 8 Background Relocation Dynamic loading and linking Swapping Contiguous Allocation Paging Segmentation Copyright
More informationChapter 8: Main Memory
Chapter 8: Main Memory Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Example: The Intel 32 and 64-bit Architectures Example:
More informationLecture 8 Memory Management Strategies (chapter 8)
Bilkent University Department of Computer Engineering CS342 Operating Systems Lecture 8 Memory Management Strategies (chapter 8) Dr. İbrahim Körpeoğlu http://www.cs.bilkent.edu.tr/~korpe 1 References The
More informationBackground Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation
Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Basic Hardware Address Binding Logical VS Physical Address Space Dynamic Loading Dynamic Linking and Shared
More informationMemory Management Cache Base and Limit Registers base limit Binding of Instructions and Data to Memory Compile time absolute code Load time
Memory Management To provide a detailed description of various ways of organizing memory hardware To discuss various memory-management techniques, including paging and segmentation To provide a detailed
More informationChapter 8: Memory Management. Operating System Concepts with Java 8 th Edition
Chapter 8: Memory Management 8.1 Silberschatz, Galvin and Gagne 2009 Background Program must be brought (from disk) into memory and placed within a process for it to be run Main memory and registers are
More informationCS307 Operating Systems Main Memory
CS307 Main Memory Fan Wu Department of Computer Science and Engineering Shanghai Jiao Tong University Spring 2018 Background Program must be brought (from disk) into memory and placed within a process
More informationSHANDONG UNIVERSITY 1
Chapter 8 Main Memory SHANDONG UNIVERSITY 1 Contents Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium SHANDONG UNIVERSITY 2 Objectives
More informationChapter 8 Main Memory
COP 4610: Introduction to Operating Systems (Spring 2014) Chapter 8 Main Memory Zhi Wang Florida State University Contents Background Swapping Contiguous memory allocation Paging Segmentation OS examples
More information6 - Main Memory EECE 315 (101) ECE UBC 2013 W2
6 - Main Memory EECE 315 (101) ECE UBC 2013 W2 Acknowledgement: This set of slides is partly based on the PPTs provided by the Wiley s companion website (including textbook images, when not explicitly
More informationPrinciples of Operating Systems
Principles of Operating Systems Lecture 18-20 - Main Memory Ardalan Amiri Sani (ardalan@uci.edu) [lecture slides contains some content adapted from previous slides by Prof. Nalini Venkatasubramanian, and
More informationChapter 9 Memory Management Main Memory Operating system concepts. Sixth Edition. Silberschatz, Galvin, and Gagne 8.1
Chapter 9 Memory Management Main Memory Operating system concepts. Sixth Edition. Silberschatz, Galvin, and Gagne 8.1 Chapter 9: Memory Management Background Swapping Contiguous Memory Allocation Segmentation
More informationChapter 8: Memory Management. Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging
Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 1 Background Memory management is crucial in better utilizing one of the most important
More informationMain Memory. Electrical and Computer Engineering Stephen Kim ECE/IUPUI RTOS & APPS 1
Main Memory Electrical and Computer Engineering Stephen Kim (dskim@iupui.edu) ECE/IUPUI RTOS & APPS 1 Main Memory Background Swapping Contiguous allocation Paging Segmentation Segmentation with paging
More informationFile Systems. OS Overview I/O. Swap. Management. Operations CPU. Hard Drive. Management. Memory. Hard Drive. CSI3131 Topics. Structure.
File Systems I/O Management Hard Drive Management Virtual Memory Swap Memory Management Storage and I/O Introduction CSI3131 Topics Process Management Computing Systems Memory CPU Peripherals Processes
More informationChapter 8 Memory Management
Chapter 8 Memory Management Da-Wei Chang CSIE.NCKU Source: Abraham Silberschatz, Peter B. Galvin, and Greg Gagne, "Operating System Concepts", 9th Edition, Wiley. 1 Outline Background Swapping Contiguous
More informationBackground. Contiguous Memory Allocation
Operating System Lecture 8 2017.5.9 Chapter 8 (Main Memory) Background Swapping Contiguous Memory Allocation Segmentation - Paging Memory Management Selection of a memory-management method for a specific
More informationMemory Management. Minsoo Ryu. Real-Time Computing and Communications Lab. Hanyang University.
Memory Management Minsoo Ryu Real-Time Computing and Communications Lab. Hanyang University msryu@hanyang.ac.kr Topics Covered Introduction Memory Allocation and Fragmentation Address Translation Paging
More informationCS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS SPRING 2013 Lecture 13: Paging Prof. Alan Mislove (amislove@ccs.neu.edu) Paging Physical address space of a process can be noncontiguous; process is allocated physical memory
More informationMain Memory Yi Shi Fall 2017 Xi an Jiaotong University
Main Memory Yi Shi Fall 2017 Xi an Jiaotong University Goals Background Swapping Contiguous Memory Allocation Segmentation Paging Structure of the Page Table Background Program must be brought (from disk)
More informationMemory Management Minsoo Ryu Real-Time Computing and Communications Lab. Hanyang University
Memory Management Minsoo Ryu Real-Time Computing and Communications Lab. Hanyang University msryu@hanyang.ac.kr Topics Covered Introduction Memory Allocation and Fragmentation Address Translation Paging
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 L17 Main Memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ Was Great Dijkstra a magician?
More informationRoadmap. Tevfik Koşar. CSC Operating Systems Spring Lecture - XII Main Memory - II. Louisiana State University
CSC 4103 - Operating Systems Spring 2007 Lecture - XII Main Memory - II Tevfik Koşar Louisiana State University March 8 th, 2007 1 Roadmap Dynamic Loading & Linking Contiguous Memory Allocation Fragmentation
More informationP r a t t hr h ee e : e M e M m e o m r o y y M a M n a a n g a e g m e e m n e t 8.1/72
Part three: Memory Management programs, together with the data they access, must be in main memory (at least partially) during execution. the computer keeps several processes in memory. Many memory-management
More informationCS 3733 Operating Systems:
CS 3733 Operating Systems: Topics: Memory Management (SGG, Chapter 08) Instructor: Dr Dakai Zhu Department of Computer Science @ UTSA 1 Reminders Assignment 2: extended to Monday (March 5th) midnight:
More informationChapter 8: Memory- Management Strategies Dr. Varin Chouvatut
Part I: Overview Part II: Process Management Part III : Storage Management Chapter 8: Memory- Management Strategies Dr. Varin Chouvatut, Silberschatz, Galvin and Gagne 2010 Chapter 8: Memory Management
More informationPerformance of Various Levels of Storage. Movement between levels of storage hierarchy can be explicit or implicit
Memory Management All data in memory before and after processing All instructions in memory in order to execute Memory management determines what is to be in memory Memory management activities Keeping
More informationTopics: Memory Management (SGG, Chapter 08) 8.1, 8.2, 8.3, 8.5, 8.6 CS 3733 Operating Systems
Topics: Memory Management (SGG, Chapter 08) 8.1, 8.2, 8.3, 8.5, 8.6 CS 3733 Operating Systems Instructor: Dr. Turgay Korkmaz Department Computer Science The University of Texas at San Antonio Office: NPB
More informationUnit-03 Deadlock and Memory Management Unit-03/Lecture-01
1 Unit-03 Deadlock and Memory Management Unit-03/Lecture-01 The Deadlock Problem 1. A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set.
More informationVirtual Memory. CSCI 315 Operating Systems Design Department of Computer Science
Virtual Memory CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture have been largely based on those from an earlier edition of the course text Operating
More informationCSE 421/521 - Operating Systems Fall Lecture - XII Main Memory Management. Tevfik Koşar. University at Buffalo. October 18 th, 2012.
CSE 421/521 - Operating Systems Fall 2012 Lecture - XII Main Memory Management Tevfik Koşar University at Buffalo October 18 th, 2012 1 Roadmap Main Memory Management Fixed and Dynamic Memory Allocation
More informationECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Memory Management
ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective Part I: Operating system overview: Memory Management 1 Hardware background The role of primary memory Program
More informationChapter 8: Memory Management
Chapter 8: Memory Management Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 8.2 Silberschatz, Galvin and Gagne 2005 Background Program/Code
More informationMain Memory (II) Operating Systems. Autumn CS4023
Operating Systems Autumn 2017-2018 Outline 1 Main Memory (II) Outline Main Memory (II) 1 Main Memory (II) Paging Main Memory (II) Physical address space of a process can be noncontiguous; process is allocated
More informationChapter 8 & Chapter 9 Main Memory & Virtual Memory
Chapter 8 & Chapter 9 Main Memory & Virtual Memory 1. Various ways of organizing memory hardware. 2. Memory-management techniques: 1. Paging 2. Segmentation. Introduction Memory consists of a large array
More informationMain Memory (Part I)
Main Memory (Part I) Amir H. Payberah amir@sics.se Amirkabir University of Technology (Tehran Polytechnic) Amir H. Payberah (Tehran Polytechnic) Main Memory 1393/8/5 1 / 47 Motivation and Background Amir
More informationOperating Systems. Designed and Presented by Dr. Ayman Elshenawy Elsefy
Operating Systems Designed and Presented by Dr. Ayman Elshenawy Elsefy Dept. of Systems & Computer Eng.. AL-AZHAR University Website : eaymanelshenawy.wordpress.com Email : eaymanelshenawy@yahoo.com Reference
More informationCS420: Operating Systems
Main Memory James Moscola Department of Engineering & Computer Science York College of Pennsylvania Based on Operating System Concepts, 9th Edition by Silberschatz, Galvin, Gagne Background Program must
More informationOutlook. Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium
Main Memory Outlook Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium 2 Backgound Background So far we considered how to share
More informationMain Memory (Part II)
Main Memory (Part II) Amir H. Payberah amir@sics.se Amirkabir University of Technology (Tehran Polytechnic) Amir H. Payberah (Tehran Polytechnic) Main Memory 1393/8/17 1 / 50 Reminder Amir H. Payberah
More informationChapter 8: Main Memory. Operating System Concepts 8th Edition
Chapter 8: Main Memory Operating System Concepts 8th Edition Silberschatz, Galvin and Gagne 2009 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page
More informationMemory Management and Protection
Part IV Memory Management and Protection Sadeghi, Cubaleska RUB 2008-09 Course Operating System Security Memory Management and Protection Main Memory Virtual Memory Roadmap of Chapter 4 Main Memory Background
More informationChapter 9 Memory Management
Contents 1. Introduction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threads 6. CPU Scheduling 7. Process Synchronization 8. Deadlocks 9. Memory Management 10. Virtual
More informationBasic Memory Management. Basic Memory Management. Address Binding. Running a user program. Operating Systems 10/14/2018 CSC 256/456 1
Basic Memory Management Program must be brought into memory and placed within a process for it to be run Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester Mono-programming
More informationPage Table Structure. Hierarchical Paging. Hashed Page Tables. Inverted Page Tables
Page Table Structure Hierarchical Paging Hashed Page Tables Inverted Page Tables 1 Hierarchical Page Tables Problem: for very large logical address spaces (2 32 and 2 64 ) the page table itself becomes
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 20 Main Memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Pages Pages and frames Page
More informationMulti-Process Systems: Memory (2) Memory & paging structures: free frames. Memory & paging structures. Physical memory
Multi-Process Systems: Memory (2) What we will learn A detailed description of various ways of organizing memory Discuss various memory-management techniques, including paging and segmentation To provide
More informationMemory Management. Dr. Yingwu Zhu
Memory Management Dr. Yingwu Zhu Big picture Main memory is a resource A process/thread is being executing, the instructions & data must be in memory Assumption: Main memory is super big to hold a program
More informationCS6401- Operating System UNIT-III STORAGE MANAGEMENT
UNIT-III STORAGE MANAGEMENT Memory Management: Background In general, to rum a program, it must be brought into memory. Input queue collection of processes on the disk that are waiting to be brought into
More informationIntroduction to Operating Systems
Introduction to Operating Systems Lecture 6: Memory Management MING GAO SE@ecnu (for course related communications) mgao@sei.ecnu.edu.cn Apr. 22, 2015 Outline 1 Issues of main memory 2 Main memory management
More informationBasic Memory Management
Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester 10/15/14 CSC 2/456 1 Basic Memory Management Program must be brought into memory and placed within a process for it
More informationMemory Management. Reading: Silberschatz chapter 9 Reading: Stallings. chapter 7 EEL 358
Memory Management Reading: Silberschatz chapter 9 Reading: Stallings chapter 7 1 Outline Background Issues in Memory Management Logical Vs Physical address, MMU Dynamic Loading Memory Partitioning Placement
More informationChapters 9 & 10: Memory Management and Virtual Memory
Chapters 9 & 10: Memory Management and Virtual Memory Important concepts (for final, projects, papers) addressing: physical/absolute, logical/relative/virtual overlays swapping and paging memory protection
More informationThe Memory Management Unit. Operating Systems. Autumn CS4023
Operating Systems Autumn 2017-2018 Outline The Memory Management Unit 1 The Memory Management Unit Logical vs. Physical Address Space The concept of a logical address space that is bound to a separate
More informationUNIT-III VIRTUAL MEMORY
MEMORY MANAGEMENT: The main purpose of a computer system is to execute programs. These programs, together with the data they access, must be at least partially in main memory during execution. To improve
More informationMemory and multiprogramming
Memory and multiprogramming COMP342 27 Week 5 Dr Len Hamey Reading TW: Tanenbaum and Woodhull, Operating Systems, Third Edition, chapter 4. References (computer architecture): HP: Hennessy and Patterson
More informationOperating Systems. 09. Memory Management Part 1. Paul Krzyzanowski. Rutgers University. Spring 2015
Operating Systems 09. Memory Management Part 1 Paul Krzyzanowski Rutgers University Spring 2015 March 9, 2015 2014-2015 Paul Krzyzanowski 1 CPU Access to Memory The CPU reads instructions and reads/write
More informationMemory Management. Dr. Yingwu Zhu
Memory Management Dr. Yingwu Zhu Big picture Main memory is a resource A process/thread is being executing, the instructions & data must be in memory Assumption: Main memory is infinite Allocation of memory
More information12: Memory Management
12: Memory Management Mark Handley Address Binding Program goes through multiple steps from compilation to execution. At some stage, addresses in the program must be bound to physical memory addresses:
More informationOperating System 1 (ECS-501)
Operating System 1 (ECS-501) Unit- IV Memory Management 1.1 Bare Machine: 1.1.1 Introduction: It has the ability to recover the operating system of a machine to the identical state it was at a given point
More informationVII. Memory Management
VII. Memory Management 1 Intended Schedule Date Lecture Hand out Submission 0 20.04. Introduction to Operating Systems Course registration 1 27.04. Systems Programming using C (File Subsystem) 1. Assignment
More informationCSE 4/521 Introduction to Operating Systems. Lecture 14 Main Memory III (Paging, Structure of Page Table) Summer 2018
CSE 4/521 Introduction to Operating Systems Lecture 14 Main Memory III (Paging, Structure of Page Table) Summer 2018 Overview Objective: To discuss how paging works in contemporary computer systems. Paging
More informationAddresses in the source program are generally symbolic. A compiler will typically bind these symbolic addresses to re-locatable addresses.
1 Memory Management Address Binding The normal procedures is to select one of the processes in the input queue and to load that process into memory. As the process executed, it accesses instructions and
More informationCOSC Operating Systems Design, Fall 2001, Byunggu Yu. Chapter 9 Memory Management (Lecture Note #8) 1. Background
COSC4740 01 Operating Systems Design, Fall 2001, Byunggu Yu Chapter 9 Memory Management (Lecture Note #8) 1. Background The computer programs, together with the data they access, must be in main memory
More informationFall 2015 COMP Operating Systems. Lab 06
Fall 2015 COMP 3511 Operating Systems Lab 06 Outline Monitor Deadlocks Logical vs. Physical Address Space Segmentation Example of segmentation scheme Paging Example of paging scheme Paging-Segmentation
More informationOperating Systems. Memory Management. Lecture 9 Michael O Boyle
Operating Systems Memory Management Lecture 9 Michael O Boyle 1 Memory Management Background Logical/Virtual Address Space vs Physical Address Space Swapping Contiguous Memory Allocation Segmentation Goals
More informationMemory management: outline
Memory management: outline Concepts Swapping Paging o Multi-level paging o TLB & inverted page tables 1 Memory size/requirements are growing 1951: the UNIVAC computer: 1000 72-bit words! 1971: the Cray
More informationOperating Systems Unit 6. Memory Management
Unit 6 Memory Management Structure 6.1 Introduction Objectives 6.2 Logical versus Physical Address Space 6.3 Swapping 6.4 Contiguous Allocation Single partition Allocation Multiple Partition Allocation
More informationMemory Management (2)
EECS 3221.3 Operating System Fundamentals No.9 Memory Management (2) Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University Memory Management Approaches Contiguous Memory
More information9.1 Background. In Chapter 6, we showed how the CPU can be shared by a set of processes. As a result of
Chapter 9 MEMORY MANAGEMENT In Chapter 6, we showed how the CPU can be shared by a set of processes. As a result of CPU scheduling, we can improve both the utilization of the CPU and the speed of the computer's
More informationMemory management: outline
Memory management: outline Concepts Swapping Paging o Multi-level paging o TLB & inverted page tables 1 Memory size/requirements are growing 1951: the UNIVAC computer: 1000 72-bit words! 1971: the Cray
More information