Simple Sequence Oriented Disk (SSOD) Scheduling Algorithm
Author(s) -
Monu Kumar,
Mukul Panwar,
Sanjay Bhargava
Publication year - 2014
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/17497-8029
Subject(s) - computer science , simple (philosophy) , algorithm , scheduling (production processes) , sequence (biology) , simple algorithm , mathematical optimization , mathematics , physics , thermodynamics , philosophy , epistemology , biology , genetics
the hard-disk technology has been improved considerably. A significant amount of work also has been done to reduce the seek time of the disk. With the increased speed of processor, faster RAM compatible disk scheduling algorithms had been proposed and some of them are really implemented. The main focus of most of the proposed algorithms is to reduce head movement. In this paper a new disk scheduling algorithm has been proposed ie. Simple Sequence Oriented Disk Scheduling Algorithm (SSOD) which significantly reduces the head movement when compared to some famous already existing disk scheduling algorithms. Keywordsscheduling, SSTF, C-LOOK, SCAN, FCFS, C-SCAN, LOOK, HEAD MOVEMENT, RQ (Request Queue)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom