2015
DOI: 10.5120/ijca2015906592
|View full text |Cite
|
Sign up to set email alerts
|

Reformed FCFS Disk Scheduling Algorithm

Abstract: In this paper an improved version of the First come first serve (FCFS) disk scheduling algorithm is provided. In the proposed approach we have made use of maximum and minimum service. It provides fast access time and dish bandwidths for disk drives which makes the efficient usage of hardware.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…So most of the researchers try to optimize the LOOK disk scheduling algorithm by reducing the seek time. Saman and Ritika [10] have proposed an algorithm, which calculates the difference between the highest request value and the lowest request value and then compares it with the current head position and then implements LOOK algorithm to service the requests. Sourav et al in [11] and Sandipon et al in [12] developed two similar disk scheduling algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…So most of the researchers try to optimize the LOOK disk scheduling algorithm by reducing the seek time. Saman and Ritika [10] have proposed an algorithm, which calculates the difference between the highest request value and the lowest request value and then compares it with the current head position and then implements LOOK algorithm to service the requests. Sourav et al in [11] and Sandipon et al in [12] developed two similar disk scheduling algorithms.…”
Section: Introductionmentioning
confidence: 99%