Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Disk Scheduling Algorithms: - Operating System Computer Mansi Mandaviya Mansi Karia 4 (

    Uploaded by

    Tayga Ina Apdyrahmaan
    This document summarizes several disk scheduling algorithms: - First Come First Serve (FCFS) services requests in the order they arrive, resulting in the highest seek time of 640 cylinders in the example. - Shortest Seek Time First (SSTF) selects the request that minimizes the seek distance from the current head position, resulting in lower seek time of 236 cylinders. - SCAN and C-SCAN algorithms move the disk head across the disk in one direction, then reverse and move back, distributing wait times more evenly compared to FCFS and SSTF. C-SCAN returns to the start of the disk after reaching the end.

    Copyright:

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

    Disk Scheduling Algorithms: - Operating System Computer Mansi Mandaviya Mansi Karia 4 (

    Uploaded by

    Tayga Ina Apdyrahmaan
    37 views15 pages
    This document summarizes several disk scheduling algorithms: - First Come First Serve (FCFS) services requests in the order they arrive, resulting in the highest seek time of 640 cylinders in the example. - Shortest Seek Time First (SSTF) selects the request that minimizes the seek distance from the current head position, resulting in lower seek time of 236 cylinders. - SCAN and C-SCAN algorithms move the disk head across the disk in one direction, then reverse and move back, distributing wait times more evenly compared to FCFS and SSTF. C-SCAN returns to the start of the disk after reaching the end.

    Original Title

    diskschedulingalgorithms

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document summarizes several disk scheduling algorithms: - First Come First Serve (FCFS) services requests in the order they arrive, resulting in the highest seek time of 640 cylinders in the example. - Shortest Seek Time First (SSTF) selects the request that minimizes the seek distance from the current head position, resulting in lower seek time of 236 cylinders. - SCAN and C-SCAN algorithms move the disk head across the disk in one direction, then reverse and move back, distributing wait times more evenly compared to FCFS and SSTF. C-SCAN returns to the start of the disk after reaching the end.

    Copyright:

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

    Disk Scheduling Algorithms: - Operating System Computer Mansi Mandaviya Mansi Karia 4 (

    Uploaded by

    Tayga Ina Apdyrahmaan
    This document summarizes several disk scheduling algorithms: - First Come First Serve (FCFS) services requests in the order they arrive, resulting in the highest seek time of 640 cylinders in the example. - Shortest Seek Time First (SSTF) selects the request that minimizes the seek distance from the current head position, resulting in lower seek time of 236 cylinders. - SCAN and C-SCAN algorithms move the disk head across the disk in one direction, then reverse and move back, distributing wait times more evenly compared to FCFS and SSTF. C-SCAN returns to the start of the disk after reaching the end.

    Copyright:

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

    Disk Scheduling algorithms

    Subject:- Operating system


    Branch : - Computer
    Presented By : - Paresh Parmar
    : - Mansi Mandaviya
    : - Mansi Karia
    Sem : - 4 (2016)
    Branch:- Computer

    (Government Engineering college ,


    Bhavnagar) 1
     Disk Scheduling Algorithms are used to
    reduce the total seek time of any
    request.

     The operating system is responsible for


    using hardware efficiently — for the disk
    drives, this means having a fast access
    time and disk bandwidth.
    Disk Scheduling

     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
    3
    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
    4
    FCFS

    Illustration shows total head movement of 640 cylinders.


    5
    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.

    6
    SSTF (Cont.)

    7
    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.
    8
    SCAN (Elevator)

    9
    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.

    10
    C-SCAN (Cont.)

    11
    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.

    12
    C-LOOK (Cont.)

    13
    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 14
    default algorithm.
    Thank you....

    You might also like