Operating System Virtual Lab - Disk Scheduling Algorithm

Operating System Virtual Lab - Disk Scheduling Algorithm - Team 23 - PDEU

You can get the source get on my GitHub. The link for the same is:

Team Members:
1. Priyank Rana (19BCP099)
2. Rushil Vora (19BCP111)
3. Vismay Gajera (19BCP140)
4. Ravi Trivedi (19BCP104)
5. Ratnam Shah (19BCP103)

Disk Scheduling is one of the core and integral concepts of the Operating systems. In this Graphical user interface, we have tried our best to cover maximum of the theory and implementation part of the disk scheduling algorithms. In total, we have implemented seven disk scheduling algorithms which includes FCFS, SSTF, LIFO, SCAN, LOOK, C SCAN and C LOOK. We have provided all the information about those algorithms as well. The language and layout are kept very simple so that anyone can get the concepts very easily. In practical part, the users can interact very easily with the help of user-friendly and understandable interface of the GUI. We have also featured the comparison of all the algorithms through which one compare the parameters like seek count and order of arrival of all the algorithms in one graph. The overall purpose of creating this GUI is to create an online simulator of how various Disk Scheduling algorithms works.

Goals
1. To get the output sequence of track number for a particular input given by the user.
2. To plot the graph of track no. vs order of arrival in order to understand the algorithm.
3. To compare the seek count of all the algorithms for a particular input in a single graph to understand the efficiency of all the algorithms.

There are total 7 algorithms implemented in this application:
1. First come First serve (FCFS)
2. Shortest Seek Time First (SSTF)
3. Last In First Out(LIFO)
4. SCAN
5. C - SCAN
6. LOOK
7. C - LOOK

For every Algorithm, we have given Graph plotting Functionality Through which the user can plot the graph for every combination of inputs also we have given the option of comparison using graph where user can compare the graph of all the algorithms mentioned. Some more features of our application are descried below.