Comparative Study of Disk Scheduling Algorithms and Proposal of a New Algorithm for Better Efficiency

Shankar, Avneesh; Ravat, Abhijeet; Pandey, Abhishek

doi:10.2139/ssrn.3349013

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It works on the movement of Left and Right head, after measuring their distance from the position of memory request with lowest track and the position and memory request with high track respectively. Similarly, Avneesh, Abhijeet, and Abhishek [18] have developed another disk scheduling algorithm which will only work for hard disk which contains 3 head for each side of platter. Alexander [19] has performed a qualitative survey on all available disk scheduling algorithms, with a comparative analysis of STF & SPTF with all traditional scheduling algorithms.…”

Section: Introductionmentioning

confidence: 99%

An Optimized Disk Scheduling Algorithm with Bad-Sector Management

Dash¹,

Sahu²,

Kewal³

2019

IJCSEA

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%