Mass Storage and Disk Scheduling Flashcards

1
Q

Magnetic disks

A

persistant storage, secondary storage

transfer rate - between drive and computer via I/O bus

overhead due to multiple mechanical

latency due to access times

when have latency, use a buffer

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

RAID

A

redundant array of independent disks data storage virtualization technology RAID allows you to store the same data redundantly (in multiple paces) in a balanced way to improve overall performance.

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

RAID demo jetstore

A

data distributed in different ways, RAID 0 - 10 goals are reliability, availability, performance, and capacity RAID levels higher than 0 provide protection against unrecoverable data in disk sectors RAID 0 redundancy RAID 1 mirror RAID 2 checkbits

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

3 parameters for RAID

A

redundancy, parity, ECC (error correcting codes)

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

Device addresses

A

Addressed as 1 dimensional arrays of logical blocks

arr maps into sectors of disk sequentially

Vendor ID

Device ID

FF980000 memory map, goes to I/O controller

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

Disk performance

A

Tsf 4 kb on 7200 RPM disk

Most of time is fixed

t = fixed time + transfer time

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

Disk scheduling - why

A

to have fast access time

increase bandwidth

access sectors that are in proximity to current request

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

Disk scheduling access time components

A

seek time - time for the disk to move the heads to the cylinder containing the desired sector

rotational latency additional time waitng for disk to rotate to desired head

need to minimize seek time, which is approx equal to seek distance

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

Disk scheduling algorithms

A

FCFS first come first served - next in line in queue

SSTF shortest seek time first - selects request with minimum seek time from the current head position

a form of SJF scheduling, may cause starvation

SCAN - elevator algorithm, disk arm starts at one end of disk, moves toward other end, servicing requests; at other end, reverses, continues to work requests

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

Disk scheduling calculate control bits

A

250 / 216 = 234 bits where 216 is 64k block

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