OS Organization Chapter 7:Memory Management: Memory Partitioning.

Home > Preview

The flashcards below were created by user geschw66 on FreezingBlue Flashcards.


  1. 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.
    Fixed Partitioning
  2. 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.(?)
    Dynamic Partitioning
  3. 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.(?)
    Simple Paging
  4. 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
    Simple Segmentation
  5. 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.
    Virtual Memory Paging
  6. 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.
    Virtual Memory Segmentation
  7. Memory Partitioning (Memory Management Techniques): Which two memory management techniques have the weakness of overhead of complex memory management?
    • Virtual Memory Segmentation
    • Virtual Memory Paging
  8. 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. Starvation
    C. I/O fragmentation
    D. Internal fragmentation
    E. None of the above
    A. External fragmentation
    (this multiple choice question has been scrambled)
  9. Placement Algorithms: Name the three placement algorithms
    • Best Fit
    • Next Fit
    • First Fit
  10. 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
    C. Compaction
  11. Placement Algorithms: This placement algorithm chooses the block that is closest in size to the request.
    Best-fit
  12. Short-term Scheduling: which algorithm is described by: Select the process that has been waiting the longest for service.
    First Come First Served (FCFS).
  13. 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.
    Round Robin (RR)
  14. Short-term Scheduling: which algorithm is described by: Select the process with the shortest expected processing time and do not preempt the process.
    Shortest Process Next (SPN)

Card Set Information

Author:
geschw66
ID:
319944
Filename:
OS Organization Chapter 7:Memory Management: Memory Partitioning.
Updated:
2016-05-10 17:24:17
Tags:
OS organization Organization Computer Science Memory Partitioning
Folders:

Description:
CSE 422s OS Organization Spring Semester 2016 @ WUSTL
Show Answers:

Home > Flashcards > Print Preview