Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 55 views

    Chapter 14: Mass-Storage Systems

    Uploaded by

    Ujjawal Mallik
    This document summarizes key topics in chapter 14 on mass storage systems: - It describes disk structure, addressing, and mapping of logical blocks to physical sectors. - It covers various disk scheduling algorithms like FCFS, SSTF, SCAN, C-SCAN, and C-LOOK and how they minimize seek time. - It discusses disk management tasks like partitioning, formatting, boot blocks, and handling bad blocks.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Chapter 14: Mass-Storage Systems

    Uploaded by

    Ujjawal Mallik
    55 views15 pages
    This document summarizes key topics in chapter 14 on mass storage systems: - It describes disk structure, addressing, and mapping of logical blocks to physical sectors. - It covers various disk scheduling algorithms like FCFS, SSTF, SCAN, C-SCAN, and C-LOOK and how they minimize seek time. - It discusses disk management tasks like partitioning, formatting, boot blocks, and handling bad blocks.

    Original Description:

    ch14

    Original Title

    ch14

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document summarizes key topics in chapter 14 on mass storage systems: - It describes disk structure, addressing, and mapping of logical blocks to physical sectors. - It covers various disk scheduling algorithms like FCFS, SSTF, SCAN, C-SCAN, and C-LOOK and how they minimize seek time. - It discusses disk management tasks like partitioning, formatting, boot blocks, and handling bad blocks.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    55 views15 pages

    Chapter 14: Mass-Storage Systems

    Uploaded by

    Ujjawal Mallik
    This document summarizes key topics in chapter 14 on mass storage systems: - It describes disk structure, addressing, and mapping of logical blocks to physical sectors. - It covers various disk scheduling algorithms like FCFS, SSTF, SCAN, C-SCAN, and C-LOOK and how they minimize seek time. - It discusses disk management tasks like partitioning, formatting, boot blocks, and handling bad blocks.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 15

    Chapter 14: Mass-Storage Systems

    Disk Structure
    Disk Scheduling
    Disk Management
    Swap-Space Management
    RAID Structure
    Disk Attachment
    Stable-Storage Implementation
    Tertiary Storage Devices
    Operating System Issues
    Performance Issues

    Operating System Concepts 14.1 Silberschatz, Galvin and Gagne 2002


    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.

    Operating System Concepts 14.2 Silberschatz, Galvin and Gagne 2002


    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.
    Transfer Time, Disk Bandwidth, Throughput, Response
    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.

    Operating System Concepts 14.3 Silberschatz, Galvin and Gagne 2002


    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

    Operating System Concepts 14.4 Silberschatz, Galvin and Gagne 2002


    FCFS

    Illustration shows total head movement of 640 cylinders.

    Operating System Concepts 14.5 Silberschatz, Galvin and Gagne 2002


    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.

    Operating System Concepts 14.6 Silberschatz, Galvin and Gagne 2002


    SSTF (Cont.)

    Operating System Concepts 14.7 Silberschatz, Galvin and Gagne 2002


    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.
    Sometimes called the elevator algorithm.
    Illustration shows total head movement of 208 cylinders.

    Operating System Concepts 14.8 Silberschatz, Galvin and Gagne 2002


    SCAN (Cont.)

    Operating System Concepts 14.9 Silberschatz, Galvin and Gagne 2002


    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.

    Operating System Concepts 14.10 Silberschatz, Galvin and Gagne 2002


    C-SCAN (Cont.)

    Operating System Concepts 14.11 Silberschatz, Galvin and Gagne 2002


    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.

    Operating System Concepts 14.12 Silberschatz, Galvin and Gagne 2002


    C-LOOK (Cont.)

    Operating System Concepts 14.13 Silberschatz, Galvin and Gagne 2002


    Selecting a Disk-Scheduling Algorithm

    SSTF is common and has a natural appeal


    SCAN and C-SCAN perform better for systems that place
    a heavy load on the disk.
    Performance depends on the number and types of
    requests.
    Requests for disk service can be influenced by the file-
    allocation method.
    The disk-scheduling algorithm should be written as a
    separate module of the operating system, allowing it to be
    replaced with a different algorithm if necessary.
    Either SSTF or LOOK is a reasonable choice for the
    default algorithm.

    Operating System Concepts 14.14 Silberschatz, Galvin and Gagne 2002


    Disk Management

    Low-level formatting, or physical formatting Dividing a


    disk into sectors that the disk controller can read and
    write.
    To use a disk to hold files, the operating system still
    needs to record its own data structures on the disk.
    Partition the disk into one or more groups of cylinders.
    Logical formatting or making a file system.
    Boot block initializes system.
    The bootstrap is stored in ROM.
    Bootstrap loader program.
    Methods such as sector sparing used to handle bad
    blocks.

    Operating System Concepts 14.15 Silberschatz, Galvin and Gagne 2002

    You might also like