The Disk is one of the crucial Computer resources, which schedules multiple read-write requests. Efficient use of Hardware for disk drives in Operating System depends on fast access of drives and large disk bandwidth. To support multiprogramming, Operating system needs to service several read write requests together. In this paper, we compared the performance of improved approaches of Disk Scheduling i.e. Optimized Disk Scheduling Algorithm, new Heuristic and sort Mid Current Comparison on the basis of seek length and disk bandwidth. Most of the researchers in past worked on various disk scheduling algorithm but no one has determined algorithmic complexity. The goal of this work is to conclude on an improved Disk Scheduling Algorithm which meets the requirement of efficient hardware utilization and increase the serviceable I/O request. This comparative study gives a fair idea to choose an appropriate algorithm when desired


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Comparative analysis of an Optimized, NHA, SMCC Disk Scheduling Algorithm


    Contributors:


    Publication date :

    2018-03-01


    Size :

    2702251 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    SMCC: Self-Managing Congestion Control Algorithm

    Sh. Jamali / A. Eftekhari | BASE | 2009

    Free access

    Optimized Vehicle Scheduling Algorithm of Distribution Center

    Wang, Zhu | Trans Tech Publications | 2013


    Optimized Entropy Based Algorithm for Aircraft Scheduling Problem

    Mahmud, Ayman Almabruk / Jeberson, W. | IEEE | 2018


    Efficient LRU Algorithm for Cache Scheduling in a Disk Array System

    Jin, H. / Hwang, K. | British Library Online Contents | 2000


    Optimized Load-Scheduling Algorithm for CubeSat's Electric Power System Management Considering Communication Link

    Hussein, Bayan / Massoud, Ahmed M. / Khattab, Tamer | IEEE | 2023

    Free access