Scribd Logo
Upload

Welcome to Scribd!

  • 57 views

    Disk Scheduling Algorithms

    Uploaded by

    rambabu mahato
    Disk scheduling algorithms are used to reduce disk seek time by determining the order in which requests are servied. Common algorithms include FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK. FCFS services requests in arrival order but can result in high seek times. SSTF services the nearest request first regardless of request direction to minimize seek time, though it has overhead in determining the closest request. Example problems demonstrate calculating seek time for FCFS and SSTF.

    Copyright:

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

    Disk Scheduling Algorithms

    Uploaded by

    rambabu mahato
    57 views4 pages
    Disk scheduling algorithms are used to reduce disk seek time by determining the order in which requests are servied. Common algorithms include FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK. FCFS services requests in arrival order but can result in high seek times. SSTF services the nearest request first regardless of request direction to minimize seek time, though it has overhead in determining the closest request. Example problems demonstrate calculating seek time for FCFS and SSTF.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Disk scheduling algorithms are used to reduce disk seek time by determining the order in which requests are servied. Common algorithms include FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK. FCFS services requests in arrival order but can result in high seek times. SSTF services the nearest request first regardless of request direction to minimize seek time, though it has overhead in determining the closest request. Example problems demonstrate calculating seek time for FCFS and SSTF.

    Copyright:

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

    Disk Scheduling Algorithms

    Uploaded by

    rambabu mahato
    Disk scheduling algorithms are used to reduce disk seek time by determining the order in which requests are servied. Common algorithms include FCFS, SSTF, SCAN, C-SCAN, LOOK, and C-LOOK. FCFS services requests in arrival order but can result in high seek times. SSTF services the nearest request first regardless of request direction to minimize seek time, though it has overhead in determining the closest request. Example problems demonstrate calculating seek time for FCFS and SSTF.

    Copyright:

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

    Disk Scheduling Algorithms-

     The algorithms used for disk scheduling are called as disk scheduling
    algorithms.
     The purpose of disk scheduling algorithms is to reduce the total seek time.

    Various disk scheduling algorithms are-


    1. FCFS Algorithm
    2. SSTF Algorithm
    3. SCAN Algorithm
    4. C-SCAN Algorithm
    5. LOOK Algorithm
    6. C-LOOK Algorithm
    FCFS Disk Scheduling Algorithm-
     As the name suggests, this algorithm entertains requests in the order they
    arrive in the disk queue.
     It is the simplest disk scheduling algorithm.
    Advantages-
     It is simple, easy to understand and implement.
     It does not cause starvation to any request.
    Disadvantages-
     It results in increased total seek time.

    PRACTICE PROBLEM BASED ON FCFS DISK


    SCHEDULING ALGORITHM-

    1. Consider a disk queue with requests for I/O to blocks on cylinders 98,
    183, 41, 122, 14, 124, 65, 67. The FCFS scheduling algorithm is used.
    The head is initially at cylinder number 53. The cylinders are numbered
    from 0 to 199. The total head movement (in number of cylinders)
    incurred while servicing these requests is _______.
    Solution-

    Total head movements incurred while servicing these requests


    = (98 – 53) + (183 – 98) + (183 – 41) + (122 – 41) + (122 – 14) + (124 – 14) +
    (124 – 65) + (67 – 65)
    = 45 + 85 + 142 + 81 + 108 + 110 + 59 + 2
    = 632
    SSTF Disk Scheduling Algorithm-
     SSTF stands for Shortest Seek Time First.
     This algorithm services that request next which requires least number of
    head movements from its current position regardless of the direction.
     It breaks the tie in the direction of head movement.
    Advantages-
     It reduces the total seek time as compared to FCFS.
     It provides increased throughput.
     It provides less average response time and waiting time.
    Disadvantages-
     There is an overhead of finding out the closest request.
     The requests which are far from the head might starve for the CPU.
     It provides high variance in response time and waiting time.
     Switching the direction of head frequently slows down the algorithm.
    Problem-01:
    Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41,
    122, 14, 124, 65, 67. The SSTF scheduling algorithm is used. The head is initially
    at cylinder number 53 moving towards larger cylinder numbers on its servicing
    pass. The cylinders are numbered from 0 to 199. The total head movement (in
    number of cylinders) incurred while servicing these requests is _______.
    Solution

    Total head movements incurred while servicing these requests

    = (65 – 53) + (67 – 65) + (67 – 41) + (41 – 14) + (98 – 14) + (122 – 98) +
    (124 – 122) + (183 – 124)
    = 12 + 2 + 26 + 27 + 84 + 24 + 2 + 59
    = 236
    Problem-02:
    Consider a disk system with 100 cylinders. The requests to access the cylinders
    occur in following sequence-
    4, 34, 10, 7, 19, 73, 2, 15, 6, 20
    Assuming that the head is currently at cylinder 50, what is the time taken to satisfy
    all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest
    seek time first policy is used?
    Solution

    Total head movements incurred while servicing these requests


    = (50 – 34) + (34 – 20) + (20 – 19) + (19 – 15) + (15 – 10) + (10 – 7) + (7 – 6) +
    (6 – 4) + (4 – 2) + (73 – 2)
    = 16 + 14 + 1 + 4 + 5 + 3 + 1 + 2 + 2 + 71
    = 119
    Time taken for one head movement = 1 msec. So,
    Time taken for 119 head movements
    = 119 x 1 msec
    = 119 msec

    You might also like