Review the following memory management techniques; afterward discuss the strengt

Question

Review the following memory management techniques; afterward discuss the strengths and weaknesses of each.

Fixed Partitioning: Main memory is divided into a number of static partitions at system generation time. A process may be loaded into a partition of equal or greater size.

Dynamic Partitioning: Partitions are created dynamically, so that each process is loaded into a partition of exactly the same size as that process.

Simple Paging: Main memory is divided into a number of equal-size frames. Each process is divided into a number of equal-size pages of the same length as frames. A process is loaded by loading all of its pages into available, not necessarily contiguous, frames.

Simple Segmentation: 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.

Virtual-Memory Paging: 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 Segmentation: As with simple segmentation, except that it is not necessary to load all of the segments of a process. Nonresident segments that are needed are brought in later automatically.

Explanation / Answer

1.Fixed Partitioning:

STRENGTH:

Simple to implement;

little operating system overhead.

WEAKNESS:

Inefficient use of memory due to internal fragmentation

maximum number of active processes is fixed

2.DYNAMIC PARTIONING:

Strengths: No internal fragmentation is required

It is more efficient to use main memory.

Weaknesses:

external fragmentation is needed

there is a lot of need for compaction.

3.Simple Paging:

Strengths: No external fragmentation is required in simple paging

Weaknesses: A small amount of internal fragmentation is required

4.simple segmentation:

Strengths: No internal fragmentation is required

Weaknesses:

Strengths: No internal fragmentation.

Weaknesses: As compared to dynamic partionong improved memory utilization is required overhead is reduced

5.Virtual-Memory Paging:

STRENGTH:No external fragmentation is required

Higher degree of multiprogramming is required
Large virtual address space is needed

WEAKNESS:

Overhead of complex memory management is one of the weakness of it.

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.