Disc scheduler algorithms performance analysis using object-oriented programming

Abstract

Disc scheduling, as one of the basic tasks of an operating system, requires applying various conventional techniques and policies, such as First Come First Serve (FCFS), Shortest Seek Time First (SSTF), SCAN, Circular SCAN (C-SCAN), LOOK, and Circular LOOK (C-LOOK). These algorithms will be presented and evaluated in terms of seek time calculated with results obtained for Total Head Movements (THMs) for all algorithms. Input data are randomly generated in the form of sequence of requests in executable files, obtained from scripts written in Python programming language. In order to facilitate running the executable files with a simple button click, a proper Graphical User Interface (GUI) in Python is also developed. The results of the study are compared for all proposed algorithms with the aim to estimate the algorithms' performances