Mass-Storage Systems/ Disc
Management System
Sagarika Chowdhury
Asst. Professor,
NIT, Kolkata
• Disk Management [3L]: disk structure, disk
scheduling (FCFS, SSTF, SCAN,C-SCAN) , disk
reliability, disk formatting, boot block, bad
blocks.
Courtesy:
Most of the slides of this ppt has
been shared from Silberschatz-ch12-
DiskManagementSystem
Chapter 12: Mass-Storage Systems
• Disk Structure
• Disk Scheduling
Objectives
• Describe the physical structure of secondary and tertiary storage devices
and the resulting effects on the uses of the devices
• Explain the performance characteristics of mass-storage devices
• Discuss operating-system services provided for mass storage, including RAID
and HSM
Overview of Mass Storage Structure
• Magnetic disks provide bulk of secondary storage of modern computers
– Drives rotate at 60 to 200 times per second
– Transfer rate is rate at which data flow between drive and computer
– Positioning time (random-access time) is time to move disk arm to
desired cylinder (seek time) and time for desired sector to rotate
under the disk head (rotational latency)
– Head crash results from disk head making contact with the disk
surface
• That’s bad
• Disks can be removable
• Drive attached to computer via I/O bus
– Busses vary, including EIDE, ATA, SATA, USB, Fibre Channel, SCSI
– Host controller in computer uses bus to talk to disk controller built
into drive or storage array
Moving-head Disk Mechanism
Overview of Mass Storage Structure (Cont.)
• Magnetic tape
– Was early secondary-storage medium
– Relatively permanent and holds large quantities of data
– Access time slow
– Random access ~1000 times slower than disk
– Mainly used for backup, storage of infrequently-used data,
transfer medium between systems
– Kept in spool and wound or rewound past read-write head
– Once data under head, transfer rates comparable to disk
– 20-200GB typical storage
– Common technologies are 4mm, 8mm, 19mm, LTO-2 and SDLT
Disk Structure
• Disk drives are addressed as large 1-dimensional arrays of
logical blocks, where the logical block is the smallest unit
of transfer
• The 1-dimensional array of logical blocks is mapped into
the sectors of the disk sequentially
– Sector 0 is the first sector of the first track on the
outermost cylinder
– Mapping proceeds in order through that track, then
the rest of the tracks in that cylinder, and then
through the rest of the cylinders from outermost to
innermost
Disk Scheduling
• The operating system is responsible for using hardware
efficiently — for the disk drives, this means having a fast
access time and disk bandwidth
• Access time has two major components
– Seek time is the time for the disk are to move the
heads to the cylinder containing the desired sector
– Rotational latency is the additional time waiting for
the disk to rotate the desired sector to the disk head
• 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.)
• Several algorithms exist to schedule the servicing of disk I/O
requests
• We illustrate them with a request queue (0-199)
98, 183, 37, 122, 14, 124, 65, 67
Head pointer 53
FCFS
Illustration shows total head movement of 640 cylinders
SSTF
• Selects the request with the minimum seek time
from the current head position
• SSTF scheduling is a form of SJF scheduling; may
cause starvation of some requests
• Illustration shows total head movement of 236
cylinders
SSTF (Cont.)
SCAN
• The disk arm starts at one end of the disk, and
moves toward the other end, servicing requests
until it gets to the other end of the disk, where
the head movement is reversed and servicing
continues.
• SCAN algorithm Sometimes called the elevator
algorithm
• Illustration shows total head movement of 208
cylinders
SCAN (Cont.)
C-SCAN
• Provides a more uniform wait time than SCAN
• The head moves from one end of the disk to the
other, servicing requests as it goes
– When it reaches the other end, however, it
immediately returns to the beginning of the
disk, without servicing any requests on the
return trip
• Treats the cylinders as a circular list that wraps
around from the last cylinder to the first one
C-SCAN (Cont.)
C-LOOK
• Version of C-SCAN
• Arm only goes as far as the last request in
each direction, then reverses direction
immediately, without first going all the way
to the end of the disk
C-LOOK (Cont.)
