CO203 Study Guide - Abul Kashem, Kuwait University, Computer Engineering
Document Summary
Analysis and visualisation of various disk scheduling algorithms. Contents: introduction, disk scheduling algorithms, terminologies, types of scheduling algorithms, fcfs scheduling algorithm, sstf scheduling algorithm, scan scheduling algorithm, c-scan scheduling algorithm, example problems for visualisation. As we know, a process needs two type of time, cpu time and io time. For i/o, it requests the operating system to access the disk. However, the operating system must be fare enough to satisfy each request and at the same time, operating system must maintain the efficiency and speed of process execution. The technique that operating system uses to determine the request which is to be satisfied next is called disk scheduling. Disk scheduling algorithms are needed because a process can make multiple i/o requests and multiple processes run at the same time. The requests made by a process may be located at different sectors on different tracks. Due to this, the seek time may increase more.
