1. Memory Management 1 Tanenbaum Ch. 3 Silberschatz Ch. 8,9

2. cs431-cotter2 Background System User 1 User 2 User 3

3. cs431-cotter3 Creating an Executable File prog.c

4. cs431-cotter4 Creating an Executable File prog.c prog.o sqrt.c Compiler sqrt.o

5. cs431-cotter5 Creating an Executable File prog.c Linker prog.o prog.exe sqrt.c Compiler sqrt.o Library

6. cs431-cotter6 Address Binding Compile Time –Specify the physical memory locations during the compile. Load Time –Determine physical addresses when all modules are combined into a load module and loaded into memory Execution Time –Bind addresses when module is executed (to allow flexibility in moving process during execution).

7. cs431-cotter7 Figure 3-1. Three simple ways of organizing memory with an operating system and one user process. No Memory Abstraction Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

8. cs431-cotter8 Figure 3-2. Illustration of the relocation problem. Multiple Programs Without Memory Abstraction Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

9. cs431-cotter9 Hardware support for relocation CPU < Limit Register Relocation Register + Memory addressing error:

10. cs431-cotter10 Hardware support for relocation CPU < Limit Register Relocation Register + Memory addressing error:

11. cs431-cotter11 Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639 Figure 3-3. Base and limit registers can be used to give each process a separate address space. Base and Limit Registers

12. cs431-cotter12 Swapping Move a currently executing process temporarily out of memory and into a backing store to make room for a new (higher priority?) process. Typically uses load time binding, but can use execution time binding. Context switching time can be high –100k / 1000k = 100 milliseconds

13. cs431-cotter13 Figure 3-4. Memory allocation changes as processes come into memory and leave it. The shaded regions are unused memory. Swapping (1) Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

14. cs431-cotter14 Figure 3-5. (a) Allocating space for growing data segment. (b) Allocating space for growing stack, growing data segment. Swapping (2) Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

15. cs431-cotter15 Manage Free Memory With Bit Maps With Linked Lists

16. cs431-cotter16 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. Memory Management with Bitmaps Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

17. cs431-cotter17 Figure 3-7. Four neighbor combinations for the terminating process, X. Memory Management with Linked Lists Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

18. cs431-cotter18 Early Memory Management Techniques Fixed Partitioning –Simple to Implement but inefficient use of memory Dynamic Partitioning –No internal fragmentation, but inefficient use of processor

19. cs431-cotter19 Fixed Partitioning OS 8 meg

20. cs431-cotter20 Fixed Partitioning OS 8 meg OS 8 meg 12 meg 16 meg 6 meg 4 meg 2 meg

21. cs431-cotter21 Dynamic Partitioning Was used by IBM (OS/MVT) Create partitions when needed OS P1 P2 P3

22. cs431-cotter22 Dynamic Partitioning Was used by IBM (OS/MVT) Create partitions when needed OS P1 P2 P3 !P2

23. cs431-cotter23 Dynamic Partitioning Was used by IBM (OS/MVT) Create partitions when needed OS P1 P2 P3 P4 P3 !P2P4

24. cs431-cotter24 Dynamic Partitioning Was used by IBM (OS/MVT) Create partitions when needed OS P1 P2 P3 P4 P3 P4 !P2P4!P1

25. cs431-cotter25 Dynamic Partitioning Was used by IBM (OS/MVT) Create partitions when needed OS P1 P5 P2 P3 P4 !P2P4!P1P5 P4

26. cs431-cotter26 Placement Algorithms First-fit –Use the first available hole that will work Next-fit –Search continues from where last allocation was made Best-fit –Consider all available holes and use the one that most closely fits. Worst-fit –Consider all available holes and use the one that leaves the largest remaining free hole. Quick Fit –Maintain separate lists of more common sizes

27. cs431-cotter27 Logical vs. Physical Address Space Logical Address –Referred to in executing programs –Generated by CPU (also known as virtual address) Physical address –Refers to an actual storage location in memory. Memory Management is the process of mapping logical addresses to the appropriate physical address. Relocation register used to map between domains

28. cs431-cotter28 Paging Difficult to find memory holes large enough to satisfy new process needs. Simplify the problem: Break the process memory requirements into many smaller sized lots. Divide physical memory into fixed size blocks called frames (typically 512 to 16 meg) Divide logical memory (process memory needs) into same sized blocks called pages Allocate as many frames as needed

29. cs431-cotter29 Address Translation Architecture CPU Physical Memory Page Table f logical address physical address

30. cs431-cotter30 Address Translation Architecture CPU Physical Memory Page Table p d d f p { logical address physical address

31. cs431-cotter31 Address Translation Architecture CPU Physical Memory Page Table p df d f p { logical address physical address

32. cs431-cotter32 Paging Example Page 0 Page 1 Page 2 Page 3 Page 0 Page 1 Page 2 Page 3 14371437 01230123 logical memory page table physical memory 0 1 2 3 4 5 6 7

33. cs431-cotter33 Paging Example Page 0 Page 1 Page 2 Page 3 Page 0 Page 1 Page 2 Page 3 14371437 01230123 logical memory page table physical memory 0 1 2 3 4 5 6 7

34. cs431-cotter34 Paging Example Page 0 Page 1 Page 2 Page 3 Page 0 Page 1 Page 2 Page 3 14371437 01230123 logical memory page table physical memory 0 1 2 3 4 5 6 7

35. cs431-cotter35 Figure 3-8. The position and function of the MMU – shown as being a part of the CPU chip (it commonly is nowadays). Logically it could be a separate chip, was in years gone by. Virtual Memory – Paging Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

36. cs431-cotter36 Figure 3-10. The internal operation of the MMU with 16 4-KB pages. Paging Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

37. cs431-cotter37 Figure 3-11. A typical page table entry. Structure of Page Table Entry Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

38. cs431-cotter38 Paging implementation issues: The mapping from virtual address to physical address must be fast. If the virtual address space is large, the page table will be large. Speeding Up Paging Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall, Inc. All rights reserved. 0-13-6006639

39. cs431-cotter39 Summary Memory Management Background Memory Partitioning Paging

40. cs431-cotter40 Questions Explain the difference between logical address space and physical address space. Which parts of a computer system use logical addresses and which parts use physical addresses? When considering dynamic memory partitioning, what is the major disadvantage of the “best fit” algorithm? What is the advantage of the “worst fit” algorithm? How (where) is virtual memory managed in contemporary computer systems? In an MMU why would we ever want to disable caching? The book suggests that page sizes range from 512 bytes to perhaps 64kbytes. What are the advantages of a small page size? When is a large page size preferred?