Memory Management Flashcards

1
Q

what is a source module?

A

a program written in a symbolic language like C or Assembly

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

what is an object module?

A

machine language output from the compiler

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

what is a load module?

A

a program that is ready to be loaded into main memory and executed

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

an object model is the input to the __________

A

linker

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

what is the difference between static and dynamic program relocation?

A

static binds all logical addresses to physical addresses prior to execution. dynamic delays this until the thing is needed during execution

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

what does the 50% rule imply?

A

that 1/3 of all memory partitions are holes…importantly it makes no distinction about memory utilization only the holes

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

what is memory compaction?

A

shifting of modules in memory to consolidate and reduce fragmentation. normally this is done by just shifting all memory in one direction

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

for each process, pages are numbered consecutively starting with ____

A

0

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

the OS maintains ______________ for each logical space

A

separate page table

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

what is a memory segment?

A

a variable sized block of logical address space identified by a single number, the segment number

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

how are pages and segments different?

A

segments are dynamically sized

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

what is the translation lookaside buffer?

A

a fast associative memory buffer that maintains recent translations of logical address to frames (a cache)

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

in the LRU, what is the referenced bit? (r-bit)

A

a bit associated with a page that is set automatically by the hardware whenever the page is referenced

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

in the LRU, what is the aging register?

A

the page is shifted to the right by 1 bit over time to “age” it

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

what is the second-chance page replacement algorithm?

A

a coarse-grain approximation of the LRU. Uses the r-bit to divide all pages into to categories: recently used and not recently used

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

what is the third-change page replacement algorithm?

A

a coarse-grain LRU, divides pages into 4 categories based on a combination of r-bit and m-bit (modified bit) values

17
Q

what is the optimal working set of a process?

A

the set of pages that will be needed in the immediate future

18
Q

what is “effective access time” in terms of page faults?

A

the average time to access memory in the presence of page faults. it’s a function of the frequency of page faults