2010INT Operating Systems, School of Information Technology, Griffith University – Gold Coast Copyright © William Stallings 20012003/2 Memory Management.

Slides:



Advertisements
Similar presentations
Chapters 7 & 8 Memory Management Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College, Venice,
Advertisements

Chapter 7 Memory Management
Part IV: Memory Management
Memory Management Chapter 7.
Fixed/Variable Partitioning
Memory Management Chapter 7. Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated efficiently to pack as.
Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable supply of ready processes to.
Allocating Memory.
Chapter 7 Memory Management
Chapter 7 Memory Management Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2009, Prentice.
CS 311 – Lecture 21 Outline Memory management in UNIX
Memory Management. Managing Memory … The Simplest Case The O/S User Program 0 0xFFF … * Early PCs and Mainframes * Embedded Systems One user program at.
OS Fall’02 Memory Management Operating Systems Fall 2002.
Chapter 7 Memory 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)
Memory Management Chapter 7.
Module 3.0: 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.
Memory Management Chapter 5.
Memory Management Five Requirements for Memory Management to satisfy: –Relocation Users generally don’t know where they will be placed in main memory May.
1 Memory Management Memory Management Requirements –Relocation A programmer does not know in advance which other programs will be resident in main memory.
03/05/2008CSCI 315 Operating Systems Design1 Memory Management Notice: The slides for this lecture have been largely based on those accompanying the textbook.
Chapter 7 Memory Management
1 Lecture 8: Memory Mangement Operating System I Spring 2008.
Chapter 91 Memory Management Chapter 9   Review of process from source to executable (linking, loading, addressing)   General discussion of memory.
1 Memory Management Chapter 7. 2 Roadmap n Memory management u Objectives u Requirements n Simple memory management u Memory partitioning F Fixed partitioning.
Chapter 7 Memory Management Seventh Edition William Stallings Operating Systems: Internals and Design Principles.
Operating System Chapter 7. Memory Management Lynn Choi School of Electrical Engineering.
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-7 Memory Management (1) Department of Computer Science and Software.
Operating System 7 MEMORY MANAGEMENT. MEMORY MANAGEMENT REQUIREMENTS.
Memory Management Chapter 7.
Chapter 7 Memory Management Seventh Edition William Stallings Operating Systems: Internals and Design Principles.
1 Memory Management Memory Management COSC513 – Spring 2004 Student Name: Nan Qiao Student ID#: Professor: Dr. Morteza Anvari.
Memory Management Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2008, Prentice Hall Dr.
Chapter 7 Memory Management
Chapter 7 Memory Management Seventh Edition William Stallings Operating Systems: Internals and Design Principles.
Memory Management Chapter 7.
Memory Management. Roadmap Basic requirements of Memory Management Memory Partitioning Basic blocks of memory management –Paging –Segmentation.
Subject: Operating System.
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
1 Memory Management Chapter 8. 2 Memory Management n It is the task carried out by the OS and hardware to accommodate multiple processes in main memory.
Basic Memory Management 1. Readings r Silbershatz et al: chapters
Informationsteknologi Wednesday, October 3, 2007Computer Systems/Operating Systems - Class 121 Today’s class Memory management Virtual memory.
CS6502 Operating Systems - Dr. J. Garrido Memory Management – Part 1 Class Will Start Momentarily… Lecture 8b CS6502 Operating Systems Dr. Jose M. Garrido.
Memory management Ref: Stallings G.Anuradha. What is memory management? The task of subdivision of user portion of memory to accommodate multiple processes.
Memory Management Program must be brought (from disk) into memory and placed within a process for it to be run Main memory and registers are only storage.
CSNB224 – AAG 2007 Memory Management Chapter 7. CSNB224 – AAG 2007 Memory Management In uniprogramming system, memory is divided into two parts: for the.
Chapter 7 Memory Management Eighth Edition William Stallings Operating Systems: Internals and Design Principles.
Memory Management Chapter 5 Advanced Operating System.
1 Memory Management n In most schemes, the kernel occupies some fixed portion of main memory and the rest is shared by multiple processes.
MEMORY MANAGEMENT. memory management  In a multiprogramming system, in order to share the processor, a number of processes must be kept in memory. 
COMP 3500 Introduction to Operating Systems Memory Management: Part 2 Dr. Xiao Qin Auburn University Slides.
Memory Management Chapter 7.
Chapter 7 Memory Management
Memory Management Chapter 7.
ITEC 202 Operating Systems
Requirements, Partitioning, paging, and segmentation
Chapter 8 Main Memory.
Economics, Administration & Information system
Memory Management Chapter 7.
Operating System Chapter 7. Memory Management
Operating Systems: Internals and Design Principles, 6/E
Chapter 7 Memory Management
Presentation transcript:

2010INT Operating Systems, School of Information Technology, Griffith University – Gold Coast Copyright © William Stallings /2 Memory Management Lecture 8

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 References “Operating Systems”, William Stallings, Prentice Hall, 4 th ed. 2001, Chapter 7

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated efficiently to pack as many processes into memory as possible

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Memory Management Requirements Relocation  Programmer does not know where the program will be placed in memory when it is executed  While the program is executing, it may be swapped to disk and returned to main memory at a different location (relocated)  Memory references must be translated in the code to actual physical memory address

Addressing Requirements for a Process (Stallings Fig. 7.1)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Memory Management Requirements Protection  Processes should not be able to reference memory locations in another process without permission  Impossible to check absolute addresses in programs since the program could be relocated  Must be checked during execution Operating system cannot anticipate all of the memory references a program will make

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Memory Management Requirements Sharing  Allow several processes to access the same portion of memory  Better to allow each process (person) access to the same copy of the program rather than have their own separate copy

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Memory Management Requirements Logical Organization  Programs are written in modules  Modules can be written and compiled independently  Different degrees of protection given to modules (read-only, execute-only)  Share modules

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Memory Management Requirements Physical Organization  Memory available for a program plus its data may be insufficient Overlaying allows various modules to be assigned the same region of memory  Programmer does not know how much space will be available

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Fixed Partitioning Equal-size partitions  any process whose size is less than or equal to the partition size can be loaded into an available partition  if all partitions are full, the operating system can swap a process out of a partition  a program may not fit in a partition. The programmer must design the program with overlays

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Fixed Partitioning Main memory use is inefficient. Any program, no matter how small, occupies an entire partition. This is called internal fragmentation.

Example of Fixed Partitioning of a 64 Mbyte Memory (Stallings fig 7.25)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Placement Algorithm with Partitions Equal-size partitions  because all partitions are of equal size, it does not matter which partition is used Unequal-size partitions  can assign each process to the smallest partition within which it will fit  queue for each partition  processes are assigned in such a way as to minimize wasted memory within a partition

Memory Assignment for Fixed Partioning (Stallings Fig. 7.3)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Dynamic Partitioning Partitions are of variable length and number Process is allocated exactly as much memory as required Eventually get holes in the memory. This is called external fragmentation Must use compaction to shift processes so they are contiguous and all free memory is in one block

The Effect of Dynamic Partitioning (Stallings Fig. 7.4)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Dynamic Partitioning Placement Algorithm Operating system must decide which free block to allocate to a process Best-fit algorithm  Chooses the block that is closest in size to the request  Worst performer overall  Since smallest block is found for process, the smallest amount of fragmentation is left memory compaction must be done more often

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Dynamic Partitioning Placement Algorithm First-fit algorithm  Fastest  May have many process loaded in the front end of memory that must be searched over when trying to find a free block

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Dynamic Partitioning Placement Algorithm Next-fit  More often allocate a block of memory at the end of memory where the largest block is found  The largest block of memory is broken up into smaller blocks  Compaction is required to obtain a large block at the end of memory

Worst Fit Increasing address values Example Memory Configuration Before and After Allocation of 16 Mbyte Block (Stallings Fig. 7.5)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Buddy System Entire space available is treated as a single block of 2 U If a request of size s such that 2 U-1 < s <= 2 U, entire block is allocated  Otherwise block is split into two equal buddies  Process continues until smallest block greater than or equal to s is generated

Example of Buddy System (Stallings Fig. 7.6)

Tree Representation of Buddy System (Stallings Fig. 7.7)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Relocation When program loaded into memory the actual (absolute) memory locations are determined A process may occupy different partitions which means different absolute memory locations during execution (from swapping) Compaction will also cause a program to occupy a different partition which means different absolute memory locations

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Addresses Logical  reference to a memory location independent of the current assignment of data to memory  translation must be made to the physical address Relative  address expressed as a location relative to some known point Physical  the absolute address or actual location in main memory

Hardware Support for Relocation (Stallings Fig. 7.8)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Registers Used during Execution Base register  starting address for the process Bounds register  ending location of the process These values are set when the process is loaded and when the process is swapped in

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Registers Used during Execution The value of the base register is added to a relative address to produce an absolute address The resulting address is compared with the value in the bounds register If the address is not within bounds, an interrupt is generated to the operating system

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Paging Partition memory into small equal-size chunks and divide each process into the same size chunks The chunks of a process are called pages and chunks of memory are called frames Operating system maintains a page table for each process  contains the frame location for each page in the process  memory address consist of a page number and offset within the page

Page Tables

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Segmentation All segments of all programs do not have to be of the same length There is a maximum segment length Addressing consist of two parts - a segment number and an offset Since segments are not equal, segmentation is similar to dynamic partitioning

Page Translation

Segment Translation

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Paging vs Segmentation Invisible to User Internal Fragmentation Pages all the same length User/Application needs to be aware External Fragmentation Segments can be different lengths

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Program Loading The Loading Function (Stallings Fig. 7.13)

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Linker => Loader A Loading Scenario (Stallings Fig. 7.14) a.out

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 The Linking Function

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Absolute and Relocatable Load Modules

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 This Week’s Tutorial The Feedback Dispatcher

2010INT Operating Systems School of Information Technology GUGC 2010INT /2 Next Week’s Lecture Virtual Memory Hardware and Control Structures Operating System Software UNIX and Solaris Memory Management Linux Memory Management Windows 2000 Memory Management