Mass Storage and Disk Scheduling Flashcards
Magnetic disks
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
RAID
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.
RAID demo jetstore
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
3 parameters for RAID
redundancy, parity, ECC (error correcting codes)
Device addresses
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
Disk performance
Tsf 4 kb on 7200 RPM disk
Most of time is fixed
t = fixed time + transfer time
Disk scheduling - why
to have fast access time
increase bandwidth
access sectors that are in proximity to current request
Disk scheduling access time components
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
Disk scheduling algorithms
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
Disk scheduling calculate control bits
250 / 216 = 234 bits where 216 is 64k block