OS Organization Chapter 7:Memory Management: Memory Partitioning.

Memory Partitioning: In this partitioning technique  main memory is divided into a number of static partitions at system generation time. A process maybe loaded into a partition of equal or greater size.

Memory Partitioning: Name this partitioning technique based on the following description: Partitions are created dynamically so that each process is loaded into a partition of exactly the same size as that process.(?)

Memory Partitioning (Memory Management Techniques): This technique is described as follows: Main memory is divided into a number of equal sized frames. Each process is divided into a number of equal-sized pages of the same length as frames. A process is loaded by loading all of its pages into available, not necessarily contiguous frames.(?)

Memory Partitioning (Memory Management Techniques): In this partitioning technique each process is divided into a number of segments. a process is loaded by loading all of its segments into dynamic partitions that need not be contiguous

Memory Partitioning (Memory Management Techniques): This technique is described as follows: As with simple paging except that it is not necessary to load all of the pages of a process. Nonresident pages that are needed are brought in later automatically.

Memory Partitioning (Memory Management Techniques): As with simple segmentation, except that is NOT necessary to load all of the segments of a process. Nonresident segments that are needed are brought in later automatically.

Memory Partitioning (Memory Management Techniques): Which two memory management techniques have the weakness of overhead of complex memory management?

As time goes on memory becomes more and more fragmented memory utilization declines - memory that is external to all partitions becomes increasingly fragmented. What is this?

A. External fragmentation
B. Internal fragmentation
C. Starvation
D. I/O fragmentation
E. None of the above

Placement Algorithms: Name the three placement algorithms

A technique for over coming external fragmentation -OS shifts the process so they are contiguous & all free memory is together in one block.
A. Swapping
B. Thrashing
C. Compaction
D. None of the above

Placement Algorithms: This placement algorithm chooses the block that is closest in size to the request.

Short-term Scheduling: which algorithm is described by: Select the process that has been waiting the longest for service.

Short-term Scheduling: which algorithm is described by: Use time slicing to limit any running process to a short burst of processor time, and rotate among all ready processes.

Short-term Scheduling: which algorithm is described by: Select the process with the shortest expected processing time and do not preempt the process.