ch.9 Flashcards

1
Q

where should a program be placed

A

into a memory withing a process

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

What are thr storage that a cpu can access

A

Main memlry and registers

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

what does the main memory do

A

sees a stream of addresses , read requests , address and data and write requests

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

where does cache sit

A

between cpu and memory

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

what are the base and limit registers

A

base register : smallest legal physical memory address
limit register : size if the register

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

how do the CPU hardware protect memory space

A

by comparing every address generated by the registers

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

Draw the hardware address protection

A

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

what is an input queue

A

programs ready to be brought into memory to execute

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

what are the three stages of address binding and data to memory

A

compilr time (location known absolutr code)- load time (unknown location - relocatable code) execution time (binding delayed)

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

what is the concept of logical address

A

bound to a separate physical address space

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

what is a logical address and a physical address

A

logical : generated by cpu (virtual address)
physical : seen by memory unit

same in compile time and load time address binding scheme but different in execution time address binding scheme

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

who does the run time mapping from virtual to physical address

A

memory management unit

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

what are static and dynamic linking

A

static linking: system libraried and program code combined by loader into binary program image

Dynamic linking : linking postponed until execution time

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

where does a process get swapped to

A

backing store - accomodate copies of all memory images

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

constraints on swapping

A

pending I/O
always transfer I/O to kernel space

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

Swapping on mobile systems

A

not supported
flash memory based

17
Q

Contiguous Allocation

A

two parts - os - user processes
each process contained in a singpe section that is contiguous to the section of the next process

18
Q

multiple partition allocation

A

divide memory into fixed sized partitions

allocated memory from a hole large enough

first fit : first large enough hole
best fit “ smallesr hole that is big enough
worst fit : largest hole

19
Q

what are external and internal fragmentation

A

External :total memory space to satisfy a request but not contiguous
Internal: allocsted memory may be slightly larger

20
Q

what is compaction

A

put free space after occupied space only if relocation dynamic