Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Disk Management

    Uploaded by

    Ankit Kumar
    Disks are organized into logical blocks that are sequentially mapped to physical sectors. The operating system is responsible for scheduling disk requests to maximize efficiency by minimizing seek time and rotational latency. Common disk scheduling algorithms include First Come First Served (FCFS), Shortest Seek Time First (SSTF), SCAN, C-SCAN, and C-LOOK, with each having different approaches to determining the service order to minimize head movement across cylinders. The optimal algorithm depends on factors like workload and I/O request patterns.

    Copyright:

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

    Disk Management

    Uploaded by

    Ankit Kumar
    22 views17 pages
    Disks are organized into logical blocks that are sequentially mapped to physical sectors. The operating system is responsible for scheduling disk requests to maximize efficiency by minimizing seek time and rotational latency. Common disk scheduling algorithms include First Come First Served (FCFS), Shortest Seek Time First (SSTF), SCAN, C-SCAN, and C-LOOK, with each having different approaches to determining the service order to minimize head movement across cylinders. The optimal algorithm depends on factors like workload and I/O request patterns.

    Original Title

    disk management

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Disks are organized into logical blocks that are sequentially mapped to physical sectors. The operating system is responsible for scheduling disk requests to maximize efficiency by minimizing seek time and rotational latency. Common disk scheduling algorithms include First Come First Served (FCFS), Shortest Seek Time First (SSTF), SCAN, C-SCAN, and C-LOOK, with each having different approaches to determining the service order to minimize head movement across cylinders. The optimal algorithm depends on factors like workload and I/O request patterns.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    22 views17 pages

    Disk Management

    Uploaded by

    Ankit Kumar
    Disks are organized into logical blocks that are sequentially mapped to physical sectors. The operating system is responsible for scheduling disk requests to maximize efficiency by minimizing seek time and rotational latency. Common disk scheduling algorithms include First Come First Served (FCFS), Shortest Seek Time First (SSTF), SCAN, C-SCAN, and C-LOOK, with each having different approaches to determining the service order to minimize head movement across cylinders. The optimal algorithm depends on factors like workload and I/O request patterns.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 17

    Disk management

    Operating System Concepts


    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


    Operating System Concepts
    Operating System Concepts
    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.

    Operating System Concepts


    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
    FCFS

    Illustration shows total head movement of 640 cylinders.


    (98 – 53) + (183 – 98) + (183 – 37) + (122 – 37) + (122 – 14) + 124 -14)
    + (124 – 65) + (67 – 65)
    Head Movements = 45 + 85 + 146 + 85 + 108 + 110 + 59 + 2 = 640
    Operating System Concepts
    Queue: 23, 89, 132, 42, 187

    there are 200 cylinders numbered from 0 - 199

    the diskhead stars at number 100

    Total Head Movement = ?

    Operating System Concepts


    SSTF(shortest-seek-time-first)
    • 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


    SSTF (Cont.)

    Illustration shows total head movement of 640 cylinders.


    (65 – 53) + (67 – 65) + (67 – 37) + (37 – 14) + (98 – 14) + (122 -98) +
    (124 – 122) + (183 – 124)
    Head Movements = 12 + 2 + 30 + 23 + 84 + 24 + 2 + 59= 236
    Operating System Concepts
    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


    SCAN (Cont.)

    Operating System Concepts


    C-SCAN(Circular 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


    C-SCAN (Cont.)

    Operating System Concepts


    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


    C-LOOK (Cont.)

    Operating System Concepts


    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

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy