Đang chuẩn bị liên kết để tải về tài liệu:
Lecture Operating System: Chapter 04 - University of Technology

Lecture Operating System: Chapter 04 - Memory management presented basic memory management, swapping, virtual memory, page replacement algorithms, modeling page replacement algorithms, design issues for paging systems, implementation issues, segmentation. | Memory Management Chapter 4 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms 4.5 Modeling page replacement algorithms 4.6 Design issues for paging systems 4.7 Implementation issues 4.8 Segmentation Memory Management Ideally programmers want memory that is large fast non volatile Memory hierarchy small amount of fast, expensive memory – cache some medium-speed, medium price main memory gigabytes of slow, cheap disk storage Memory manager handles the memory hierarchy Basic Memory Management Monoprogramming without Swapping or Paging Three simple ways of organizing memory - an operating system with one user process Multiprogramming with Fixed Partitions Fixed memory partitions separate input queues for each partition single input queue Modeling Multiprogramming CPU utilization as a function of number of processes in memory Degree of multiprogramming Analysis of Multiprogramming System Performance Arrival and work requirements | Memory Management Chapter 4 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms 4.5 Modeling page replacement algorithms 4.6 Design issues for paging systems 4.7 Implementation issues 4.8 Segmentation Memory Management Ideally programmers want memory that is large fast non volatile Memory hierarchy small amount of fast, expensive memory – cache some medium-speed, medium price main memory gigabytes of slow, cheap disk storage Memory manager handles the memory hierarchy Basic Memory Management Monoprogramming without Swapping or Paging Three simple ways of organizing memory - an operating system with one user process Multiprogramming with Fixed Partitions Fixed memory partitions separate input queues for each partition single input queue Modeling Multiprogramming CPU utilization as a function of number of processes in memory Degree of multiprogramming Analysis of Multiprogramming System Performance Arrival and work requirements of 4 jobs CPU utilization for 1 – 4 jobs with 80% I/O wait Sequence of events as jobs arrive and finish note numbers show amout of CPU time jobs get in each interval Relocation and Protection Cannot be sure where program will be loaded in memory address locations of variables, code routines cannot be absolute must keep a program out of other processes’ partitions Use base and limit values address locations added to base value to map to physical addr address locations larger than limit value is an error Swapping (1) Memory allocation changes as processes come into memory leave memory Shaded regions are unused memory Swapping (2) Allocating space for growing data segment Allocating space for growing stack & data segment Memory Management with Bit Maps Part of memory with 5 processes, 3 holes tick marks show allocation units shaded regions are free Corresponding bit map Same information as a list Memory Management with Linked Lists Four neighbor combinations for the .