Chapter 34 Flashcards

1
Q

What is spatial and temporal localities

A

When a program runs it shows temporal and spatial localities. Spatial locality means program will run near by places. Temporal locality means the instructions that will run in future will near to program current execution location.

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

What are 3 structures of page table

A
  1. Hierarchical / Multilevel paging
  2. Hashed page table
  3. Inverted page table
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Can we page page table if it has bigger size

A

Yes

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

What is outer page table

A

That keeps the mapping of pages in page table is called outer page table

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

What is inner page table

A

That keeps mapping of processes

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

What is Hierarchical / Multilevel paging

A

It has 2-level paging. Outer page table and inner page table.

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

What is DEC VAX

A

A machine from DEC company

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

What is hashing

A

A key passed from a function and function returns an index value. That index value should be in between the range of index.

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

What is hashed table

A

Table built by hashed values that has mapping to corresponding record

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

What is open hashing

A

Hashing used in link list for corresponding values is called open hashing

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

What is closed hashing

A

Hashing used inside slot is called closed hashing

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

Which is more common, open hashing or closed hashing

A

open hashing

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

What are 3 fields of each entry in linked list of hashed table

A
  1. page number
  2. frame number for the page
  3. pointer to the next element
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

When hashed table is used

A

A common approach to handle address spaces larger than 32 bits

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

What is inverted page table

A

To reduce the size of page table. It works like one entry per real page.

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