CHAPTER 9 - MEMORY MANAGEMENT.ppt

CHAPTER 9 - MEMORY MANAGEMENT CGS 3763 - Operating System Concepts UCF, Spring 2004 OVERVIEW (Part 1) Address Binding Logical vs. Physical Address Space Early Techniques Dynamic Loading Overlays Swapping Contiguous Allocation Methods Partitions Fragmentation Dynamic Linking OVERVIEW (Part 2) Paging Page Tables Frame Tables Segmentation Segment Tables Segmentation with Paging BACKGROUND Program must be brought into memory and turned into a process for it to be executed. New or Job Queue contains collection of jobs on disk that are waiting to be brought into memory for execution. Single Program Systems User memory consists of a single partition Task was to make the most use of that limited space Multiprogramming Systems Must keep multiple programs in memory simultaneously Task is to manage share this limited space among multiple programs ADDRESS BINDING In order to load a program, instructions and associated data must be mapped or “bound” to specific locations in memory Address binding can happen at three different stages. Compile time: If memory location known a priori, absolute code can be generated; must recompile code if starting location changes. Load time: Must generate relocatable code if memory location is not known at compile time. Execution or Run time: Binding delayed until run time if the process can be moved during its execution from one memory segment to another. Special hardware (e.g., MMUs) required for address mapping. ADDRESS BINDING TIMES User programs go through several steps before being executed. SINGLE PROGRAM, COMPILE TIME BINDING SINGLE PROGRAM, LOAD TIME BINDING CONTIGUOUS ALLOCATION, SINGLE PARTITION SYSTEMS Simplest form of memory management to implement Characteristic of early computer systems Contiguous: All portions of memory associated with a process are kept together - not broken into parts Single Partition: User area consists of one large address space, all of which is allocated to a single user process Hardware support