Disk Scheduling

A Project Report On
SIMULATION OF DISK SCHEDULING
(Using C++ and Graphics)

Index
ABSTRACT…………………………………………………………………………………… 2
PROBLEM DEFINITION…………..…………………………………………………..….. 3
HARDWARE REQUIREMENT….……………………………………………………….. 4
SOFTWARE REQUIREMENT………………….………………………………………… 5
ALGORITHM EXPLANATION/CONCEPT …………………………………………… 6
PROJECT DIAGRAM …………………………………………………………………….. 7
SAMPLE CODE …………………………………………………………………………….. 9
SCREEN SHOTS ………………………..……………………………………………….. 10
TESTING ………………………….……………………………………………………….. 11
CONCLUSION ……………………………………………………………………..……… 12
BIBLIOGRAPHY ….……………………………………………………………………… 13

List of Tables

Sl No | Name | Description | 1 | Table 1 | Hardware Requirements | 2 | Table 2 | Software Requirements |

List of Figures Sl No | Name | Description | 1 | Figure 1 | Operating system operation | 2 | Figure 2 | Logical structure of a 1.44 MB disk | 3 | Figure 3 | First Come First Serve | 4 | Figure 4 | Last In First Out | 5 | Figure 5 | Shortest Seek Time First | 6 | Figure 6 | SCAN |

Abstract

The project entitled “DISK SCHEDULING” is developed by under Turbo C. The main objective of this project is to obtain information regarding the disk scheduling using some algorithms for checking the efficient among them during different situation. These scheduling techniques have been implemented on the floppy disk. By using this project, suitable disk scheduling algorithms can be used to improve both the access time and the band width. The project which is developed will give a brief idea about which disk scheduler is the most efficient one add also deals with the performance of strategies for scheduling the servicing of disk requests.

The main function of an operating system is to use the hardware resources efficiently. The increase in the speed of processors and the main memory has far outstripped that for disk access, with processor and main memory speeds increasing by about the orders