Chapter 11 (I/O Management and Disk Scheduling) Flashcards

1
Q

What is programmed I/O?

A

CPU issues I/O and busy waits for it to complete

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

What is interrupt-driven I/O?

A

CPU issues I/O and continues, is interrupted when I/O completes

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

What is DMA?

A

CPU issues I/O and DMA module takes over, freeing the CPU

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

What information is contained in a call to the DMA module?

A

Whether to read/write

Address of the I/O device

Starting memory address to read or write to

Number of words to read or write

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

What are the two OS design objectives for I/O?

A

Efficiency

Generality

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

What is generality?

A

Have all devices use the same interface

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

What are two types of I/O devices?

A

Block-oriented

Stream-oriented

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

What are block-oriented I/O devices?

A

Information stored in fixed size blocks

Transfers made a block at a time

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

What are stream-oriented I/O devices?

A

Transfers information as a stream of bytes (no block structure)

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

What are the advantages of a single buffer?

A

Allows next unit to be read while previous is processed

Process can be swapped since I/O is using OS buffer

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

When might a double buffer be inadequate?

A

Process performs rapid bursts of I/O

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

What can be used if a process performs rapid bursts of I/O?

A

Circular buffering

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

Define: Access time

A

Sum of seek time and rotational delay

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

Define: Seek time

A

Time it takes to position the head at the desired track

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

Define: Rotational delay

A

Time it takes for the beginning of the sector to reach the head

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

Define: Data transfer time

A

Occurs as the sector moves under the head

17
Q

What is the primary reason for differences in performance in disk scheduling policies?

A

Seek time

18
Q

What are the three characteristics of RAID?

A

Multiple physical drives viewed by the OS as a single drive

Data distributed across the drives

Redundancy to ensure recoverability if a drive fails

19
Q

What RAID levels are commercially unavailable?

A

2 and 4

20
Q

What are the characteristics of RAID level 1?

A

Duplicates all data

Every disk has a mirror disk

Simple recovery but higher cost

21
Q

Why is RAID level 2 not used?

A

Only useful if lots of disk errors occur, which is not common today

22
Q

How does RAID level 2 handle recovery?

A

Parity disk

23
Q

What are the characteristics of RAID level 3?

A

Single additional parity disk

Uses a parity bit instead of an error correcting code

24
Q

What are strips in RAID level 4?

A

Blocks

25
Q

What are the characteristics of RAID level 5?

A

Distributes parity disks across all disks

Keeps parity disk from being a bottleneck

26
Q

What are the characteristics of RAID level 6?

A

Uses two parity strips on different disks instead of just 1

Requires N+2 disks

27
Q

How many disks must fail in RAID 6 to be unavailable?

A

3

28
Q

What are the replacement algorithms for the disk cache?

A

LRU - Least recently used

LFU - Least frequently used

29
Q

What’s the problem with LFU disk cache replacement algorithms?

A

Blocks may be used repeatedly for a short amount of time, building up a high reference count, then not used again for a long time. This can cause LFU to make a poor choice.

30
Q

How can you fix the problem with LFU?

A

Divide the queue into new, middle, and old sections