AN OPTIMIZED DISK SCHEDULING ALGORITHM WITH BAD-SECTOR MANAGEMENT

In high performance computing, researchers try to optimize the CPU Scheduling algorithms, for faster and efficient working of computers. But a process needs both CPU bound and I/O bound for completion of its execution. With modernization of computers the speed of processor, hard-disk, and I/O devices increases gradually. Still the data access speed of hard-disk is much less than the speed of the processor. So when processor receives a data from secondary memory it executes immediately and again it have to wait for receiving another data. So the slowness of the hard-disk becomes a bottleneck in the performance of processor. Researchers try to develop and optimize the traditional disk scheduling algorithms for faster data transfer to and from secondary data storage devices. In this paper we try to evolve an optimized scheduling algorithm by reducing the seek time, the rotational latency, and the data transfer time in runtime. This algorithm has the feature to manage the bad-sectors of the hard-disk. It also attempts to reduce power consumption and heat reduction by minimizing bad sector reading time