ECM 1413 memory management Flashcards

1
Q

Virtual memory segmentation pros and cons

A

+can fit processes larger than memory
+Segment Sharing and protection
+No internal fragmentation
+Efficient compared to static partitioning
-more complex memory management

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Paging

A

Memory divided into equal fixed-size frames
A process is divided into same-size pages
Internal fragmentation is small as
- Only affects the last frame of each process
- The frame/page-size is fairly small

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Paging pros and cons

A

+no external fragmentation
+Simple memory allocation
-small internal fragmentation
-page tables can become large

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Internal fragmentation

A

the memory is split into mounted-sized blocks. Whenever a method is requested for the memory, the mounted-sized block is allotted to the method. In the case where the memory allotted to the method is somewhat larger than the memory requested, then the difference between allotted and requested memory is called internal fragmentation.

We fixed the sizes of the memory blocks, which has caused this issue. If we use dynamic partitioning to allot space to the process, this issue can be solved.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

External Fragmentation

A

there’s a sufficient quantity of area within the memory to satisfy the memory request of a method. However, the process’s memory request cannot be fulfilled because the memory offered is in a non-contiguous manner. Whether you apply a first-fit or best-fit memory allocation strategy it’ll cause external fragmentation.

(Space is wasted between partitions)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Virtual memory paging

A

Paging + virtual memory
Pages are loaded into frames like simple paging, except not all pages need to be loaded at the same time.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Pros and cons of virtual memory paging

A

+Can fit processes larger than memory
+No external fragmentation
+Simple memory allocation
-Virtual memory overhead
-Small internal fragmentation
-Page tables can become large

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Protection and sharing with segmentation and paging
Goals:

A
  • Protection: Each process can only access its own pages/segments
  • Sharing: Multiple processes can access the same page/segment
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Protection and sharing with segmentation and paging

A

Implementation:
- Each frame/segment has a number of protection bits specifying
○ Read, write, execute permissions, which processes have these permissions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Memory management techniques

A

Fixed Partitioning
Dynamic Partitioning
Simple Segmentation
Virtual Memory Segmentation
Simple Paging
Virtual Memory Paging

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Fixed/Static Partitioning

A

Memory divided into partitions of fixed boundaries (equal or unequal sizes)
1-to-1 mapping of partitions and processes
Process loaded into partitions ≥ its size

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Fixed Partitioning Pros and Cons

A

+Easy to understand and implement
+No external fragmentation

-Internal Fragmentation
-Limited by number & size of partitions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Dynamic Partitioning

A

Exact memory allocation – only what is needed
- Partitions of variable length and number
- 1-to-1 mapping
Starts well, then leads to external fragmentation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Compaction

A

Shift processes for unified free memory space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Dynamic partitioning Pros and Cons

A

+No internal fragmentation
+Efficient than static partitioning

-External fragmentation
-Overhead of compaction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Simple segmentation

A

Process divided into segments (mirror semantic organization - text and data)
Segments are loaded into memory as in dynamic partitioning
Segments do not need to be contiguous

17
Q

Simple Segmentation – Pros and Cons

A

+Sharing and protection
+Better handling of larger programs
+No internal fragmentation
+Efficient than static partitioning

-External fragmentation (still less than dynamic)
-Overhead of compaction

18
Q

Virtual Memory Segmentation

A

Segmentation + Virtual Memory
- Virtual memory use disk space to extend main memory; illusion of larger memory
Segments can be swapped between memory and disk storage
OS loads segments into memory as needed