Chapter 8 Flashcards

(37 cards)

1
Q

What is swapping?

A

A memory management technique where a process is moved between main memory and backing store to free space.

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

Give an example of swapping.

A

When memory is full, the OS swaps out an inactive process to load a ready process.

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

Why must swapping avoid processes with pending I/O?

A

Because swapped-out processes may attempt to use invalid I/O addresses, causing errors.

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

What is internal fragmentation?

A

The wasted space that is within that already allocated space for one of the process.

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

What is external fragmentation?

A

Wasted space between allocated blocks because free memory is split into small pieces.

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

What is compaction?

A

A technique that reduces external fragmentation by relocating processes to make memory contiguous.

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

What is segmentation?

A

Memory management dividing logical memory into variable-sized segments, each with its own segment table entry.

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

What is paging?

A

Memory management dividing memory into fixed-size pages (logical) and frames (physical).

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

What is a frame?

A

A fixed-size block in physical memory used to store a page.

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

What is a page?

A

A fixed-size block of logical memory mapped to a frame.

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

Is paging subject to fragmentation?

A

Paging avoids external fragmentation but causes internal fragmentation in the last page.

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

What is a page table?

A

A table that maps logical pages to physical frames.

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

What is a TLB?

A

A fast associative cache storing recent page table entries to speed up address translation.

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

Why use a TLB?

A

To reduce memory access time by avoiding frequent page table lookups.

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

What is a TLB hit?

A

When the requested page number is found in the TLB, speeding up translation.

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

What is a TLB miss?

A

When the requested page is not in the TLB, requiring a page table lookup.

17
Q

What happens on a TLB miss?

A

The OS accesses the page table, updates the TLB, and completes the access.

18
Q

What is the base register used for?

A

To hold the starting physical address of a process’s memory region.

19
Q

What is the limit register used for?

A

To specify the size of a process’s valid address range.

20
Q

What happens if a memory access is outside base+limit?

A

A trap occurs and the OS terminates or handles the offending process.

21
Q

Why do we need logical to physical address mapping?

A

To allow processes to use abstract logical addresses independent of physical memory layout.

22
Q

What is the MMU?

A

The Memory Management Unit that translates logical addresses to physical addresses.

23
Q

What is compile-time address binding?

A

Binding done at compilation; only works if the memory location is known and fixed.

24
Q

What is load-time address binding?

A

Binding done when the program is loaded into memory, allowing relocation.

25
What is execution-time binding?
Binding performed during execution, enabling full relocation and paging.
26
Advantage of compile-time binding?
Simple and efficient when memory location is fixed.
27
Advantage of load-time binding?
Allows programs to be placed anywhere in memory at load time.
28
Advantage of execution-time binding?
Enables movement of processes during runtime and supports paging/segmentation.
29
What is static linking?
Linking that copies library routines directly into the executable during compile time.
30
What is dynamic linking?
Loading library routines at runtime using a small stub instead of copying the full library.
31
Benefit of dynamic linking?
Reduces executable size and allows shared libraries among processes.
32
Why does segmentation help fragmentation?
It reduces internal fragmentation by using variable-sized segments.
33
Why does paging eliminate external fragmentation?
Pages and frames are fixed-size, so any free frame can be used for any page.
34
Why do we only have an integer number of frames?
Frames are fixed-size physical blocks, so memory capacity divided by frame size yields an integer count.
35
What is effective memory access time (conceptually)?
The average time to access memory considering TLB hits and misses.
36
What is page fault (not required but helpful)?
An event where a requested page is not in memory, requiring disk access.
37
Why is TLB important for performance?
It significantly reduces translation time, improving overall memory access speed.