0% found this document useful (0 votes)
4 views

OS ppt Unit 4.2

The document discusses mass storage structures, including magnetic disks, solid-state disks, and magnetic tapes, highlighting their characteristics and uses. It also covers disk scheduling algorithms like FCFS, SSTF, SCAN, and C-SCAN, which manage I/O requests for efficient disk access. Additionally, it addresses disk management aspects such as disk formatting, boot blocks, and handling bad blocks.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

OS ppt Unit 4.2

The document discusses mass storage structures, including magnetic disks, solid-state disks, and magnetic tapes, highlighting their characteristics and uses. It also covers disk scheduling algorithms like FCFS, SSTF, SCAN, and C-SCAN, which manage I/O requests for efficient disk access. Additionally, it addresses disk management aspects such as disk formatting, boot blocks, and handling bad blocks.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Mass-Storage Structure

• Mass storage refers to store large amount of


data
• There area various mass storage devices
• Magnetic Disks
• provide the bulk of secondary storage for modern computer
systems
• Each disk platter has a flat circular shape, like a CD
• The two surfaces of a platter are covered with a magnetic
material
• Solid-State Disks
• SSD is nonvolatile memory that is used like a hard drive
• SSDs have the same characteristics as traditional hard disks
but can be more reliable and faster
• they consume less power
• they are more expensive
• have less capacity
• Magnetic Tapes
• was used as an early secondary-storage medium
• hold large quantities of data
• its access time is slow
• Tapes are used mainly for backup, for storage of infrequently
used information
Disk Scheduling
• One of the responsibilities of the operating system is to use
the hardware efficiently
• A process makes the I/O requests to the operating system to
access the disk. Disk scheduling algorithm manages the
requests and decides the order of the disk access
• FCFS Scheduling
• The simplest form of disk scheduling is, the first-come, first-
served (FCFS) algorithm
• Consider, for example, a disk queue with requests for I/O to
blocks on cylinders 98, 183, 37, 122, 14, 124, 65, 67
• queue = 98, 183, 37, 122, 14, 124, 65, 67,
• head starts at 53
• total head movement is 640 cylinders
• SSTF Scheduling
• shortest-seek-time-first
• The SSTF algorithm selects the request with the least seek
time from the current head position and then chooses the
pending request closest to the current head position.
• queue = 98, 183, 37, 122, 14, 124, 65, 67,
• head starts at 53
• total head movement is 208 cylinders
• SCAN Scheduling
• In this algorithm, the disk arm starts at one end of the disk
and moves towards one end completely and reaches each
cylinder
• Then the direction of head movement is reversed reaches
each cylinder completely
• Example
• queue = 98, 183, 37, 122, 14, 124, 65, 67
• head starts at 53
• Assuming the head move towards 0
• C-SCAN Scheduling (Circular SCAN)
• In this algorithm the head moves from one end of the disk to
the other end
• When the head reaches the other end, it immediately returns
to the beginning of the disk without servicing any requests
• Example
• queue = 98, 183, 37, 122, 14, 124, 65, 67
• head starts at 53
Disk Management
• The operating system is responsible for several other aspects
of disk management
• Here we discuss disk initialization, booting from disk, and bad-
block recovery
• Disk Formatting
• Before a disk can store data, it must be divided into sectors
that the disk controller can read and write. This process is
called low-level formatting
• Most hard disks are low-level-formatted at the factory as a
part of the manufacturing process

• Boot Block
• For a computer to start running, it must have an initial
program to run
• This initial bootstrap program starts the operating system
• the bootstrap is stored in read-only memory (ROM)
• The full bootstrap program is stored in the “boot blocks” at a
fixed location on the disk
• Bad Blocks
• More frequently, one or more sectors become defective.
These defective sectors are called as bad blocks.
• Any bad blocks that are discovered are flagged as unusable
• Data that resided on the bad blocks usually are lost

You might also like