Memory Management Chapter 7 B Ramamurthy Memory Management

Memory Management Chapter 7 B. Ramamurthy

Memory Management Subdividing memory to accommodate multiple processes Memory needs to allocated efficiently to pack as many processes into memory as possible

Memory Management Requirements Relocation n 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 memory references must be translated in the code to actual physical memory address

Memory Management Requirements Protection n processes should not be able to reference memory locations in another process without permission impossible to check addresses in programs since the program could be relocated must be checked during execution

Memory Management Requirements Sharing n n 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

Memory Management Requirements Logical Organization n programs are written in modules different degrees of protection given to modules (read-only, execute-only) share modules

Memory Management Requirements Physical Organization n memory available for a program plus its data may be insufficient w overlaying allows various modules to be assigned the same region of memory n secondary memory cheaper, larger capacity, and permanent

Fixed Partitioning Main memory use is inefficient. Any program, no matter how small, occupies an entire partition. This is called Operating System internal fragmentation. 8 M 8 M 8 M

Fixed Partitioning Unequal-size partitions n lessens the problem with equal-size Operating System partitions 8 M 2 M 4 M 6 M 8 M 8 M 12 M

Placement Algorithm with Partitions Equal-size partitions n because all partitions are of equal size, it does not matter which partition is used Unequal-size partitions n n n 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

One Process Queue per Partition Operating System New Processes

One Common Process Queue When its time to load a process into main memory the smallest available partition that will hold the process is selected Operating System New Processes

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

Example Dynamic Partitioning Operating System 128 K Operating System Process 1 Operating System 320 K Process 1 Process 2 320 K 224 K 896 K 576 K 352 K

Example Dynamic Partitioning Operating System Process 1 320 K Process 2 224 K Process 3 288 K 64 K Process 1 Operating System 320 K 224 K Process 3 288 K 64 K Process 1 Process 4 Process 3 320 K 128 K 96 K 288 K 64 K

Example Dynamic Partitioning Operating System 320 K Process 4 Process 3 128 K 96 K 288 K 64 K Process 2 Process 4 Process 3 224 k 96 K 128 K 96 K 288 K 64 K

Dynamic Partitioning Placement Algorithm Operating system must decide which free block to allocate to a process Best-fit algorithm n n n 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

Dynamic Partitioning Placement Algorithm First-fit algorithm n starts scanning memory from the beginning and chooses the first available block that is large enough. Next-fit n starts scanning memory from the location of the last placement and chooses the next available block that is large enough Compaction is required to obtain a large block at the end of memory

Registers Used during Execution Base register n starting address for the process Bounds register n ending location of the process These values are set when the process is loaded and when the process is swapped in

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

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 n n contains the frame location for each page in the process memory address consist of a page number and offset within the page

Paging Frame Number 0 1 A. 0 A. 1 A. 2 A. 3 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 2 3 4 A. 0 A. 1 A. 2 A. 3 B. 0 B. 1 B. 2

Paging 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 A. 0 A. 1 A. 2 A. 3 B. 0 0 1 B. 2 C. 0 C. 1 C. 2 C. 3 5 6 7 8 9 10 11 2 3 4 12 13 14 A. 0 A. 1 A. 2 A. 3 C. 0 C. 1 C. 2 C. 3 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 A. 0 A. 1 A. 2 A. 3 D. 0 D. 1 D. 2 C. 0 C. 1 C. 2 C. 3 D. 4

Page Tables for Example 0 1 2 3 Process A 0 1 2 ------Process B 0 1 2 3 7 8 9 10 Process C 0 1 2 3 4 4 5 6 11 12 Process D 13 14 Free Frame List