Abstract

Disk scheduling is one of the main responsibilities of Operating System. OS manages hard disk to provide best access time. All major Disk scheduling algorithms incorporate seek time as the only factor for disk scheduling. The second factor rotational delay is ignored by the existing algorithms. This research paper considers both factors, Seek Time and Rotational Delay to schedule the disk. Our algorithm Fuzzy Disk Scheduling (FDS) looks at the uncertainty associated with scheduling incorporating the two factors. Keeping in view a Fuzzy inference system using If-Then rules is designed to optimize the overall performance of disk drives. Finally we compared the FDS with the other scheduling algorithms.

Highlights

  • Operating System provides an interface between user and hardware

  • Margo Seltzer, 1990, wrote a research paper “Disk Scheduling Revisited”. In this paper they discussed the disk scheduling technique based on sectors traversed and rotational delay experienced by movable head system disk drives

  • The implemented algorithm Fuzzy Disk Scheduling (FDS) is compared with other conventional algorithms and the fuzzy algorithm given by Mohamad Sofian Abu Talip [1]

Read more

Summary

Introduction

Operating System provides an interface between user and hardware. One of the major responsibilities of OS is to use the disk drive efficiently and to provide the fast access time. Different disk scheduling algorithms are used to reduce the seek time, namely, First Come First Serve (FCFS), Shortest Seek Time First (SSTF), Scan, C-Scan, Look, and C-Look. Another main component of Access Time is Rotational Delay. Data read or write operations are performed This time consumed in rotation after seeking is called as Rotational Delay. Various work is available related to reduce the seek time using different disk scheduling algorithms. They are not providing any solution to handle the uncertainty and starvation problem associated with disk scheduling.

Related Work
Disk Scheduling
Background on Fuzzy Sets and FIS
Problem Definition
Designed FIS
Results
Proposed Algorithm
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.