Unit 6: Real Memory organization management

Slides:



Advertisements
Similar presentations
Part IV: Memory Management
Advertisements

Memory Management Chapter 7. Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated efficiently to pack as.
Chapter 7 Memory Management
OS Fall’02 Memory Management Operating Systems Fall 2002.
Chapter 9 – Real Memory Organization and Management
Memory Management Chapter 7. Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated efficiently to pack as.
CSCI2413 Lecture 5 Operating Systems Memory Management 1 phones off (please)
Multiprocessing Memory Management
Memory Management Chapter 7 B.Ramamurthy. Memory Management Subdividing memory to accommodate multiple processes Memory needs to allocated efficiently.
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
9.9.2 Memory Placement Strategies Where to put incoming processes –First-fit strategy Process placed in first hole of sufficient size found Simple, low.
Memory Management 1 CS502 Spring 2006 Memory Management CS-502 Spring 2006.
Memory Management Chapter 5.
Chapter 9 Virtual Memory Produced by Lemlem Kebede Monday, July 16, 2001.
Computer Organization and Architecture
 2004 Deitel & Associates, Inc. All rights reserved. Chapter 9 – Real Memory Organization and Management Outline 9.1 Introduction 9.2Memory Organization.
1 Lecture 8: Memory Mangement Operating System I Spring 2008.
Tutorial 6 Memory Management
Operating System Chapter 7. Memory Management Lynn Choi School of Electrical Engineering.
Review of Memory Management, Virtual Memory CS448.
1 Memory Management Memory Management COSC513 – Spring 2004 Student Name: Nan Qiao Student ID#: Professor: Dr. Morteza Anvari.
Chapter 7 Memory Management
Chapter 7 Memory Management Seventh Edition William Stallings Operating Systems: Internals and Design Principles.
Cosc 2150: Computer Organization Chapter 6, Part 2 Virtual Memory.
Memory Management Chapter 7.
Page 1 2P13 Week 6. Page 2 Table 7.1 Memory Management Terms Frame A fixed-length block of main memory. Page A fixed-length block of data that resides.
Page 1 2P13 Week 5. Page 2 Page 3 Page 4 Page 5.
Memory Management. Roadmap Basic requirements of Memory Management Memory Partitioning Basic blocks of memory management –Paging –Segmentation.
Subject: Operating System.
By Teacher Asma Aleisa Year 1433 H.   Goals of memory management  To provide a convenient abstraction for programming  To allocate scarce memory resources.
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
By Teacher Asma Aleisa Year 1433 H.   Goals of memory management  To provide a convenient abstraction for programming.  To allocate scarce memory.
Memory Management Operating Systems CS550. Memory Manager Memory manager - manages allocation and de-allocation of main memory Plays significant impact.
CS 241 Section Week #9 (11/05/09). Topics MP6 Overview Memory Management Virtual Memory Page Tables.
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
Memory Management. Why memory management? n Processes need to be loaded in memory to execute n Multiprogramming n The task of subdividing the user area.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo 1 Memory management & paging.
1 Memory Management n In most schemes, the kernel occupies some fixed portion of main memory and the rest is shared by multiple processes.
 2004 Deitel & Associates, Inc. All rights reserved. Chapter 9 – Real Memory Organization and Management Outline 9.1 Introduction 9.2Memory Organization.
MEMORY MANAGEMENT. memory management  In a multiprogramming system, in order to share the processor, a number of processes must be kept in memory. 
Memory Management One of the most important OS jobs.
Memory Management Chapter 7.
Chapter 7 Memory Management
Memory Management Chapter 7.
Memory Management.
ITEC 202 Operating Systems
Chapter 2 Memory and process management
Requirements, Partitioning, paging, and segmentation
Chapter 8: Main Memory.
Memory Allocation The main memory must accommodate both:
Chapter 9 – Real Memory Organization and Management
Main Memory Management
Module IV Memory Organization.
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 8 11/24/2018.
Memory Management.
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 9 12/1/2018.
So far… Text RO …. printf() RW link printf Linking, loading
Chapter3 Memory Management Techniques
Main Memory Background Swapping Contiguous Allocation Paging
Lecture 32 Syed Mansoor Sarwar
Lecture 3: Main Memory.
Operating System Chapter 7. Memory Management
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 9 4/5/2019.
Management From the memory view, we can list four important tasks that the OS is responsible for ; To know the used and unused memory partitions To allocate.
Operating Systems: Internals and Design Principles, 6/E
Operating Systems Concepts
Chapter 7 Memory Management
Page Main Memory.
Presentation transcript:

Unit 6: Real Memory organization management Operating Systems Operating Systems Unit 6: Real Memory organization management

COP 5994 - Operating Systems Memory Hierarchy COP 5994 - Operating Systems

Memory Management Strategies Allocation Single or multiple processes Fixed or variable Fetch Demand or anticipatory Decides which piece of data to load next Placement Decides where in main memory to place incoming data Replacement Decides which data to remove from main memory to make more space COP 5994 - Operating Systems

COP 5994 - Operating Systems Memory Allocation Contiguous allocation single block of contiguous addresses hard/impossible to find a large enough block low overhead Noncontiguous allocation address space divided into segments each segment can be placed in different location easier to find “holes” in which a segment will fit more processes can run simultaneously offsets the overhead incurred by this technique COP 5994 - Operating Systems

Single Process: Contiguous Memory Allocation COP 5994 - Operating Systems

Single Process : Overlays COP 5994 - Operating Systems

Single Process: Memory Protection COP 5994 - Operating Systems

Multi Process: Fixed-Partition Allocation Fixed-partition multiprogramming Each active process receives a fixed-size block of memory Processor rapidly switches between each process Security becomes important COP 5994 - Operating Systems

Multi Process: Fixed-Partition Allocation COP 5994 - Operating Systems

Multi Process: Fixed-Partition Allocation with address translation COP 5994 - Operating Systems

Multi Process: Fixed-Partition Protection COP 5994 - Operating Systems

Multi Process: Fixed-Partition Drawbacks Internal fragmentation Process does not take up entire partition, wasting memory Process can be too big to fit anywhere Variable partitions designed as replacement COP 5994 - Operating Systems

Multi Process: Variable-Partition Allocation COP 5994 - Operating Systems

Variable-Partition Characteristics processes placed where they fit No space wasted initially Internal fragmentation impossible Partitions are exactly the size they need to be External fragmentation occurs when process ends Leaves holes too small for new processes Eventually no holes large enough for new processes COP 5994 - Operating Systems

Variable-Partition: memory holes COP 5994 - Operating Systems

Reduce external fragmentation Coalescing Combine adjacent free blocks into one large block Compaction Rearranges memory into one contiguous block of free space one contiguous block of occupied space Significant overhead COP 5994 - Operating Systems

COP 5994 - Operating Systems Memory coalescing COP 5994 - Operating Systems

COP 5994 - Operating Systems Memory compaction COP 5994 - Operating Systems

Memory Placement Strategies Where to put incoming processes First-fit strategy Process placed in first hole of sufficient size found Simple, low execution-time overhead Best-fit strategy Process placed in hole that leaves least unused space More execution-time overhead Worst-fit strategy Process placed in hole that leaves most unused space remaining large hole may be used by another process COP 5994 - Operating Systems

Memory Placement: first fit COP 5994 - Operating Systems

Memory Placement: best fit COP 5994 - Operating Systems

Memory Placement: worst fit COP 5994 - Operating Systems

Multi process with Memory Swapping remove inactive processes from memory only running process is in main memory others temporarily moved to secondary storage maximizes available memory significant overhead when switching processes COP 5994 - Operating Systems

Multi process with Memory Swapping COP 5994 - Operating Systems

Multi process with Memory Swapping Idea: keep several processes in memory Less available memory per process Much faster response times Similar to paging COP 5994 - Operating Systems

Evolution of memory organization COP 5994 - Operating Systems

COP 5994 - Operating Systems Agenda for next week: Midterm exam ! In 2 weeks: Chapter 10 & 11: Virtual Memory Read ahead ! COP 5994 - Operating Systems