Interblocage Flashcards

1
Q

Conditions for deadlock

A

Mutual Exclusion
Hold and Wait
No preemption
Circular wait

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

Mutual Exclusion

A

At least one resource must be held in a non-sharable mode.
If a process is holding a resource, others must wait.

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

Hold and Wait

A

A process is holding at least one resource and waiting to acquire more resources that are currently held by other processes.

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

No Preemption

A

Resources cannot be forcibly taken away from a process — they must be released voluntarily.

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

Circular Wait

A

There exists a circular chain of processes, each waiting for a resource held by the next process in the chain.

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

Where is page table stored?

A

RAM

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

cache line

A

the smallest unit of memory transferred into the cache (usually 64 bytes)

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

temporal locality

A

recently used data is likely to be used again

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

spacial locality

A

nearby data is likely to be accessed soon

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

eviction

A

if the cache is full, it removes the least recently used (LRU) data to make room

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

TBL

A

Translation Lookaside Buffer (cache)

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

PTBR

A

Page Table Base Register

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

virtual address contains…

A

page number, offset

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

Each entry in the segment table contains…

A
  • Base address (where the segment starts)
  • Limit (how long it is)
  • Access rights, etc.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

les étapes pour lire un fichier avec l’instruction read(index)

A
  1. Trouver la bonne entrée dans la table des fichiers ouverts par processus
  2. Trouver la bonne entrée dans la table des fichiers ouverts du système
  3. Charger le bloc de contrôle de fichier (FCB)
  4. Lire les blocs de données
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

le bloc de contrôle de fichier (FCB) dans un système de fichiers sert a…

A

contenir les informations de métadonnées du fichier

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

file metadata

A
  • File size
  • Owner (UID), group (GID)
  • Permissions (rwx bits)
  • Timestamps (created, modified, accessed)
  • Number of links (how many dir entries point to it)
  • Pointers to data blocks on disk
18
Q

Dans une allocation contiguë de fichiers, le principal inconvénient est…

A

Elle nécessite de connaître la taille du fichier à l’avance

19
Q

FAT file system entries store:

A
  • next block number
  • EOF (or equivalent)
20
Q

FAT file system directory entries store:

A
  • filename
  • starting block
  • file size
  • attributes
21
Q

Cons of FAT32:

A

Fragmentation (contiguous allocation)
Slow random access (linked list)
Scalability (limits file size)

22
Q

ext2 directories store:

A

mappings of file names to inode numbers

23
Q

inodes store:

A
  • metadata
  • pointers to data blocks
24
Q

Purpose of dirty bit

A

Indicates whether the page has been modified (written to) since it was loaded into RAM

25
Effective Access Time Formula
EAT = (hit ratio × hit time) + (miss ratio × miss time)
26
OPT algorithm
Evict page used farthest in the future
27
LRU algorithm
Evict least recently used page
28
FIFO algorithm
Evict oldest page in memory
29
Second Chance
Like FIFO but skips recently used pages
30
Docker Image contains...
App code Runtime Libraries Environment setup
31
Permissions of docker image:
read_only
32
RAID
Redundant Array of Independent Disks
33
RAID 0
No reduncancy Not fault tolerant
34
RAID 1
Every disk has a full duplicate
35
RAID 5
Block-level striping with distributed parity Stores parity blocks across all disks Needs only 1 extra disk’s worth of space Can recover from 1 disk failure
36
RAID 6
Block-level striping with distributed parity Stores 2 parity blocks across all disks Needs 2 extra disk’s worth of space Can recover from 2 disk failure
37
FCFS (First Come First Served) pros and cons
Pro: Fair Con: Slow
38
SSTF (Shortest Seek Time First) pros and cons
Pro: Fast Con: Starvation
39
SCAN pros and cons
Pro: relatively fast/fair Con: Favours middle cylinders over extremes
40
LOOK pros and cons
Pros: Faster than SCAN, fairer than SSTF Con: Favours middle cylinders over extremes
41
Average rotational latency =
1/2 * rotation time
42