Performance of Movable Head Disk Storage Devices with Various Disk Scheduling Algorithms
A Gomathy
Gomathy A, Department of Computer Science and Engineering, Hindusthan College of Engineering and Technology, Coimbatore (Tamil Nadu), India.
Manuscript received on 05 December 2019 | Revised Manuscript received on 13 December 2019 | Manuscript Published on 31 December 2019 | PP: 486-490 | Volume-9 Issue-2S December 2019 | Retrieval Number: B11251292S19/2019©BEIESP | DOI: 10.35940/ijitee.B1125.1292S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Hard drives are the one which needs to be accessed in an efficient manner so that it is feasible to get better recital of the central processing unit. Now a day’s magnetic disks are capable of providing more input output bandwidth yet a huge amount of this bandwidth is lost due to the access time of the hard disk. This paper discusses an analysis of performance of various disk scheduling algorithms with their merits and demerits.
Keywords: Fcfcs, Sstfs, Scans, C-Scans, F-Scans, Looks, C-Looks, S-Looks.
Scope of the Article: Graph Algorithms and Graph Drawing