A comparative study of effectiveness regarding existing & proposed algorithm in disk scheduling policies on changing the head position and distance between the track request

Disk Management & its Efficiency is one of the important & challenging issues of operating system before the researchers as it is required in all technical and software development. Various Scheduling Policies with varying degree of efficiency have been explored by the researchers so far. In this paper, we have made an effort to design some new scheduling policies on the basis of disk arm movement. Disk scheduling algorithms are used to reduce the total seek time of any request. Hence, to service a request, a disk system requires that the head should be moved to the desired track then a wait for latency & finally the transform of data. It has been observed that selecting an optimal disk scheduling algorithm, performance depends upon the initial head Position (IHP) on keeping the same track Request. Minimum seek Time has been calculated for different Policies & the conclusion has been drawn through graphical representation. In a nutshell, on one hand we have examined the efficiency of various scheduling algorithms & on the other hand, we explored some new algorithms on the basis of Disk Arm Movement & then a conclusion has been drawn.