Storage Management

Hard Disk Drives

 Hard Disk Drive
 Magnetic storage device.
 Stores data by magnetizing particles on a disk.
 Used to store operating system, application software, utilities and data.
 Major Parts
 Platter
 Data is stored on Platters.
 Can be single side or double side.
 Spindle
 Rotation Speed: 3,600 – 15,000 rpm.
 1 or more platters per spindle.
 Actuator
 Move head(s) move in and out.
Moving-head Disk Mechanism
 Hard Disk Drive
 Tracks
 Circular areas of the disk.
 Length of a track on circumference of disk.
 Data first written to outer most track.
 Sectors
 Track consist of multiple sectors.
 Cylinders
 Logical groupings of the same track on each disk surface.
 Data stored in sectors
 512 bytes or 4 KB
 Address of sector
 Track, Head, Sector
 Hard Disk Drive
 Access Time
 Seek time
 Time taken to move the arm and position it over required track.
 Rotational Latency
 Time taken by the platter to rotate and position the data under the
R/W head.
 Transfer time
 Time for rotating one sector over/under the head.
 Addressing:
 Cylinder, Head, Sector (CHS) addressing
 OS needs to know the geometry of each disk.
 Logical Block Addressing (LBA)
 Disk controller translates LBA to CHS
 Disk Scheduling
 OS is responsible for using hardware efficiently
 for the disk drives, this means having a fast access time
and disk bandwidth.
 Total Time
 Total Time = Seek Time + Rotational Latency + Transfer
Time
 Normally
 Seek Time > Rotational Time > Transfer Time
 Minimize seek time
 Seek time  seek distance
 Disk bandwidth is the total number of bytes transferred, divided
by the total time between the first request for service and the
completion of the last transfer.
 Disk Scheduling (Cont.)
 There are many sources of disk I/O request
 OS, System processes and Users processes
 I/O request includes
 input or output mode
 disk address
 memory address
 number of sectors to transfer
 OS maintains queue of requests, per disk or device
 Idle disk can immediately work on I/O request, busy disk means
work must queue
 Optimization algorithms only make sense when a queue exists
 Disk Scheduling (Cont.)
 Drive controllers have small buffers
 Thus can manage a small queue of I/O requests
 Several algorithms exist to schedule the servicing of disk I/O
requests.
 We illustrate scheduling algorithms with a request queue (0-199)

98, 183, 37, 122, 14, 124, 65, 67

Head pointer 53
 FCFS

total head movement of 640 cylinders