Memory Flashcards

1
Q

What does a program that has been brought from disk into memory become?

A

A process

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

What does this definition describe: only one process runs at a time

A

Uniprogramming

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

What does this definition describe: processes share hardware resources, CPU, memory

A

Multiprogramming

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

What is address space an abstraction of?

A

Physical memory

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

What sort of components in the address space are code and some global variables?

A

Static

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

What sort of components in the address space are the stack and the heap?

A

Dynamic

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

What three components does the address space consist of?

A

Code
Heap
Stack

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

Does the stack or the heap use LIFO?

A

Stack

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

What do we call the translation/mapping from virtual to physical addresses?

A

Adress translation/mapping

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

What are these the goals of:
- Transparency
- Protection
- Efficiency

A

Virtual memory

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

What sort of relocation within address translation methods does this describe:

At load time, the OS adjusts the addresses in a process to reflect its position in memory
Once a memory is assigned a place in memory and starts executing it, the OS cannot move it

A

Static relocation (no HW requirement)

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

What sort of relocation within address translation methods does this describe:

 Two registers for each process
* Base register indicates the starting address
* Bound/limit register determines the memory size
 Memory-Management Unit (MMU)
* Translate virtual addresses to physical addresses
* Such translation happens for every memory reference

A

Dynamic relocation (HW supported)

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

How is each memory reference in dynamic relocation translated?

A

Physical address = virtual address + base

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

What are the two problems with dynamic relocation?

A

Fragmentation (memory inefficiency)
Internal and external

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

What do we call the allocation of contiguous memory spaces to different processes?

A

Memory allocation

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

What sort of memory allocation is described below:
- Physical memory broken up into fixed partitions
- One base register per process

A

Fixed partition

17
Q

What are the advantages of fixed partition memory allocation?

A

Easy to implement
Fast context switch

18
Q

What are the problems with fixed partition memory allocation?

A

Internal fragmentation

19
Q

What sort of memory allocation is described below:
- Base register and limit register
- Dynamic relocation

A

Variable partition

20
Q

What are the advantages of variable partition memory allocation?

21
Q

What are the disadvantages of variable partition memory allocation?

A

External fragmentation

22
Q

When each partition has the same size, what sort of fragmentation can occur?

A

Internal fragmentation

23
Q

What do we call the allocation algorithm that allocates the first hole that’s big enough in memory?

24
Q

What do we call the allocation algorithm that allocates the smallest hole that is big enough in memory?

25
Q

What do we call the allocation algorithm that allocates the largest hole in memory?

26
Q

What do we call the allocation algorithm that keeps an extra pointer to the location within the list where one was looking last?

27
Q

What is a solution to external fragmentation?

A

Compaction

28
Q

Give the definition:
Shuffling of the memory contents to place all free memory together in one large block

A

Compaction

29
Q

What is the main concern connected to compaction?

A

Performance overhead - memory intensive

30
Q

Give the definition:
The dividing of the contiguous address space into several logic segments

A

Segmentation

31
Q

What do we call the bits added to a segment to indicate permissions of read, write and execute?

A

Protection bits

32
Q

What makes it possible to translate virtual memory into physical memory?

33
Q

Give the definition:
Multiple processes are ready to run at a given time, and the OS can switch between them

A

Multiprogramming

34
Q

Give the definition:
The running programs view of memory in the system

A

Address space

35
Q

What consists of code, stack and heap?

A

The address space

36
Q

Give the definition:
When the running program think it’s loaded into memory at a particular address and has a potentially large address space

A

Virtualizing memory

37
Q

Give the definition:
The hardware transforms each memory access, changing the virtual address provided by the instruction to a physical address where the desired information is actually located

A

Address translation