Implemented various Disk Scheduling Algorithms in Python (Operating Systems)
Implemented various Disk Scheduling Algorithms in Python
Following Disk Scheduling Algorithms are demonstrated:
1. FCFS<br>2. SSTF<br>3. SCAN<br>4. CSCAN<br>5. LOOK<br>6. CLOOK<br>
The process needs either CPU time or Input/Output Time. And for I/O it requires access to disk. The technique that operating system uses to determine the request which is to be satisfied next is called disk scheduling.
Seek Time
Seek time is the time taken in locating the disk arm to a specified track where the read/write request will be satisfied.
Rotational Latency
It is the time taken by the desired sector to rotate itself to the position from where it can access the R/W heads.
Transfer Time
It is the time taken to transfer the data.
Disk Access Time
Disk access time is given as,
Disk Access Time = Rotational Latency + Seek Time + Transfer Time
Disk Response Time
It is the average of time spent by each request waiting for the IO operation.
