Abstract
The crucial challenge that decides the success of real-time disk scheduling algorithm lies in simultaneously achieving the two contradicting objectives namely – completion time and missed tasks. This work is motivated toward developing such an algorithm. The goal of this paper is to demonstrate that the simultaneous optimization of completion time and missed tasks produces an efficient schedule for real-time disk scheduling. The objective function is designed to minimize the two parameters. An extensive experimental evaluation to compare the performance of the proposed system vs. other disk scheduling algorithms conducted on 1000 disk request sets. The observations reported that the proposed scheme is a state-of-the-art model offering minimum completion time and missed tasks.
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 callDisclaimer: 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.
